./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/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 9d3cc6bed79d5f36ef86c37a4cddb412902bd9be ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 09:34:29,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:34:29,272 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:34:29,279 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:34:29,280 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:34:29,280 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:34:29,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:34:29,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:34:29,283 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:34:29,284 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:34:29,285 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:34:29,285 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:34:29,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:34:29,286 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:34:29,287 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:34:29,287 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:34:29,288 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:34:29,289 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:34:29,290 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:34:29,292 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:34:29,292 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:34:29,293 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:34:29,294 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:34:29,295 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:34:29,295 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:34:29,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:34:29,296 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:34:29,297 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:34:29,297 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:34:29,298 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:34:29,298 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:34:29,299 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:34:29,299 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:34:29,299 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:34:29,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:34:29,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:34:29,300 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 09:34:29,308 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:34:29,308 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:34:29,309 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:34:29,309 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:34:29,309 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:34:29,309 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 09:34:29,309 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 09:34:29,310 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 09:34:29,310 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 09:34:29,310 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 09:34:29,310 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 09:34:29,310 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:34:29,310 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 09:34:29,310 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:34:29,310 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:34:29,310 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 09:34:29,310 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 09:34:29,311 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 09:34:29,311 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:34:29,311 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 09:34:29,311 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:34:29,311 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 09:34:29,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:34:29,311 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:34:29,311 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 09:34:29,312 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:34:29,312 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:34:29,312 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 09:34:29,312 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 09:34:29,312 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/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 -> 9d3cc6bed79d5f36ef86c37a4cddb412902bd9be [2018-12-08 09:34:29,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:34:29,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:34:29,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:34:29,347 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:34:29,347 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:34:29,348 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i [2018-12-08 09:34:29,388 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/uautomizer/data/e7fde894d/584c528785da40ed85265382828de7f3/FLAGe677aa541 [2018-12-08 09:34:29,852 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:34:29,852 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i [2018-12-08 09:34:29,858 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/uautomizer/data/e7fde894d/584c528785da40ed85265382828de7f3/FLAGe677aa541 [2018-12-08 09:34:29,867 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/uautomizer/data/e7fde894d/584c528785da40ed85265382828de7f3 [2018-12-08 09:34:29,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:34:29,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:34:29,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:34:29,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:34:29,873 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:34:29,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:34:29" (1/1) ... [2018-12-08 09:34:29,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725a737b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:34:29, skipping insertion in model container [2018-12-08 09:34:29,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:34:29" (1/1) ... [2018-12-08 09:34:29,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:34:29,904 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:34:30,057 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:34:30,064 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:34:30,118 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:34:30,137 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:34:30,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:34:30 WrapperNode [2018-12-08 09:34:30,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:34:30,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:34:30,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:34:30,138 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:34:30,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:34:30" (1/1) ... [2018-12-08 09:34:30,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:34:30" (1/1) ... [2018-12-08 09:34:30,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:34:30,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:34:30,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:34:30,161 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:34:30,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:34:30" (1/1) ... [2018-12-08 09:34:30,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:34:30" (1/1) ... [2018-12-08 09:34:30,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:34:30" (1/1) ... [2018-12-08 09:34:30,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:34:30" (1/1) ... [2018-12-08 09:34:30,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:34:30" (1/1) ... [2018-12-08 09:34:30,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:34:30" (1/1) ... [2018-12-08 09:34:30,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:34:30" (1/1) ... [2018-12-08 09:34:30,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:34:30,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:34:30,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:34:30,174 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:34:30,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:34:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/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 [2018-12-08 09:34:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:34:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 09:34:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 09:34:30,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:34:30,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:34:30,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:34:30,311 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:34:30,311 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-08 09:34:30,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:34:30 BoogieIcfgContainer [2018-12-08 09:34:30,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:34:30,312 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 09:34:30,312 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 09:34:30,314 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 09:34:30,314 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:34:30,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 09:34:29" (1/3) ... [2018-12-08 09:34:30,315 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d2a3b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:34:30, skipping insertion in model container [2018-12-08 09:34:30,315 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:34:30,315 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:34:30" (2/3) ... [2018-12-08 09:34:30,315 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d2a3b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:34:30, skipping insertion in model container [2018-12-08 09:34:30,315 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:34:30,315 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:34:30" (3/3) ... [2018-12-08 09:34:30,316 INFO L375 chiAutomizerObserver]: Analyzing ICFG Urban-alloca_true-termination.c.i [2018-12-08 09:34:30,347 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:34:30,347 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 09:34:30,348 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 09:34:30,348 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 09:34:30,348 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:34:30,348 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:34:30,348 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 09:34:30,348 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:34:30,348 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 09:34:30,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-08 09:34:30,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 09:34:30,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:34:30,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:34:30,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:34:30,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:34:30,372 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 09:34:30,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-08 09:34:30,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 09:34:30,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:34:30,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:34:30,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:34:30,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:34:30,378 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 8#L559-2true [2018-12-08 09:34:30,378 INFO L796 eck$LassoCheckResult]: Loop: 8#L559-2true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 13#L550-1true assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 6#L550-3true assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 9#L551true assume main_#t~mem7 > 0;havoc main_#t~mem7; 7#L552true assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 8#L559-2true [2018-12-08 09:34:30,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:30,382 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 09:34:30,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:30,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:30,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:30,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:30,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:30,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash 35409681, now seen corresponding path program 1 times [2018-12-08 09:34:30,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:30,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:30,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:30,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:30,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849167, now seen corresponding path program 1 times [2018-12-08 09:34:30,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:30,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:30,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:30,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:30,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:30,680 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:34:30,681 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:34:30,681 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:34:30,681 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:34:30,681 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:34:30,681 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:34:30,681 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:34:30,682 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:34:30,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-08 09:34:30,682 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:34:30,682 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:34:30,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:30,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,020 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:34:31,023 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:34:31,025 INFO L122 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 [2018-12-08 09:34:31,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:31,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:31,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:31,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:31,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:31,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:31,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:31,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:31,029 INFO L122 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 [2018-12-08 09:34:31,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:31,029 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:34:31,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:31,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:31,031 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:34:31,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:31,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:31,043 INFO L122 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 [2018-12-08 09:34:31,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:31,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:31,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:31,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:31,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:31,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:31,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:31,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:31,046 INFO L122 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 [2018-12-08 09:34:31,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:31,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:31,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:31,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:31,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:31,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:31,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:31,057 INFO L122 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 [2018-12-08 09:34:31,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:31,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:31,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:31,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:31,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:31,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:31,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:31,082 INFO L122 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 [2018-12-08 09:34:31,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:31,082 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:34:31,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:31,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:31,084 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:34:31,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:31,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:31,089 INFO L122 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 [2018-12-08 09:34:31,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:31,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:31,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:31,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:31,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:31,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:31,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:31,092 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:34:31,094 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 09:34:31,094 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 09:34:31,096 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:34:31,096 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 09:34:31,096 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:34:31,096 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-12-08 09:34:31,119 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 09:34:31,123 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:34:31,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:31,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:31,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:31,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:31,218 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 [2018-12-08 09:34:31,218 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2018-12-08 09:34:31,314 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 54 states and 72 transitions. Complement of second has 12 states. [2018-12-08 09:34:31,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-08 09:34:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 09:34:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-12-08 09:34:31,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 2 letters. Loop has 5 letters. [2018-12-08 09:34:31,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:31,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 7 letters. Loop has 5 letters. [2018-12-08 09:34:31,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:31,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 2 letters. Loop has 10 letters. [2018-12-08 09:34:31,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:31,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 72 transitions. [2018-12-08 09:34:31,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-08 09:34:31,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 28 states and 43 transitions. [2018-12-08 09:34:31,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-08 09:34:31,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-08 09:34:31,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 43 transitions. [2018-12-08 09:34:31,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:34:31,324 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 43 transitions. [2018-12-08 09:34:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 43 transitions. [2018-12-08 09:34:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-12-08 09:34:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-08 09:34:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2018-12-08 09:34:31,341 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-12-08 09:34:31,342 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-12-08 09:34:31,342 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 09:34:31,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2018-12-08 09:34:31,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-08 09:34:31,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:34:31,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:34:31,343 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 09:34:31,343 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:34:31,343 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 173#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 184#L550-1 [2018-12-08 09:34:31,343 INFO L796 eck$LassoCheckResult]: Loop: 184#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 174#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 175#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 179#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 180#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 184#L550-1 [2018-12-08 09:34:31,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:31,343 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-08 09:34:31,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:31,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:31,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:31,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:31,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:31,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:31,354 INFO L82 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 1 times [2018-12-08 09:34:31,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:31,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:31,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:31,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:31,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:31,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:31,365 INFO L82 PathProgramCache]: Analyzing trace with hash 177749398, now seen corresponding path program 1 times [2018-12-08 09:34:31,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:31,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:31,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:31,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:31,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:31,672 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:34:31,672 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:34:31,672 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:34:31,672 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:34:31,672 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:34:31,672 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:34:31,672 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:34:31,672 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:34:31,672 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-08 09:34:31,673 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:34:31,673 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:34:31,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,830 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-12-08 09:34:31,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:31,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,110 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:34:32,110 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:34:32,111 INFO L122 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 [2018-12-08 09:34:32,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:32,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:32,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:32,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:32,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:32,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:32,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:32,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:32,113 INFO L122 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 [2018-12-08 09:34:32,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:32,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:32,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:32,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:32,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:32,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:32,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:32,116 INFO L122 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 [2018-12-08 09:34:32,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:32,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:32,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:32,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:32,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:32,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:32,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:32,120 INFO L122 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 [2018-12-08 09:34:32,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:32,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:32,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:32,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:32,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:32,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:32,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:32,122 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:34:32,123 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 09:34:32,123 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 09:34:32,124 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:34:32,124 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 09:34:32,124 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:34:32,124 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2018-12-08 09:34:32,143 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 09:34:32,144 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:34:32,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:32,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:32,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:32,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:32,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-08 09:34:32,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:32,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 22 [2018-12-08 09:34:32,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:32,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:32,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:32,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-12-08 09:34:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:32,220 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 [2018-12-08 09:34:32,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-08 09:34:32,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 43 states and 66 transitions. Complement of second has 9 states. [2018-12-08 09:34:32,246 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 [2018-12-08 09:34:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 09:34:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-08 09:34:32,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 5 letters. [2018-12-08 09:34:32,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:32,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2018-12-08 09:34:32,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:32,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 10 letters. [2018-12-08 09:34:32,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:32,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 66 transitions. [2018-12-08 09:34:32,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-08 09:34:32,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 64 transitions. [2018-12-08 09:34:32,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-08 09:34:32,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 09:34:32,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 64 transitions. [2018-12-08 09:34:32,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:34:32,250 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 64 transitions. [2018-12-08 09:34:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 64 transitions. [2018-12-08 09:34:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-08 09:34:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-08 09:34:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2018-12-08 09:34:32,252 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 61 transitions. [2018-12-08 09:34:32,253 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 61 transitions. [2018-12-08 09:34:32,253 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 09:34:32,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 61 transitions. [2018-12-08 09:34:32,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-08 09:34:32,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:34:32,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:34:32,254 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 09:34:32,254 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:34:32,254 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 332#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 333#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 357#L550-1 assume !main_#t~short6; 353#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 347#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 348#L559 [2018-12-08 09:34:32,254 INFO L796 eck$LassoCheckResult]: Loop: 348#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 343#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 344#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 350#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 351#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 348#L559 [2018-12-08 09:34:32,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:32,254 INFO L82 PathProgramCache]: Analyzing trace with hash 889571379, now seen corresponding path program 1 times [2018-12-08 09:34:32,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:32,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:32,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:32,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:34:32,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:34:32,274 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 09:34:32,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:32,275 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 1 times [2018-12-08 09:34:32,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:32,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:32,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:32,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:32,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:32,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:34:32,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:34:32,355 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. cyclomatic complexity: 27 Second operand 3 states. [2018-12-08 09:34:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:34:32,362 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-12-08 09:34:32,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:34:32,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 61 transitions. [2018-12-08 09:34:32,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-08 09:34:32,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 39 states and 50 transitions. [2018-12-08 09:34:32,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-08 09:34:32,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-08 09:34:32,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2018-12-08 09:34:32,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:34:32,364 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-08 09:34:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2018-12-08 09:34:32,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-08 09:34:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-08 09:34:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-12-08 09:34:32,366 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-08 09:34:32,366 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-08 09:34:32,366 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 09:34:32,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2018-12-08 09:34:32,366 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-08 09:34:32,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:34:32,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:34:32,367 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 09:34:32,367 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:34:32,367 INFO L794 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 423#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 424#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 434#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 447#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 438#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 439#L559 [2018-12-08 09:34:32,367 INFO L796 eck$LassoCheckResult]: Loop: 439#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 445#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 450#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 425#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 426#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 439#L559 [2018-12-08 09:34:32,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:32,367 INFO L82 PathProgramCache]: Analyzing trace with hash 889569457, now seen corresponding path program 1 times [2018-12-08 09:34:32,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:32,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:32,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:32,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:32,375 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 2 times [2018-12-08 09:34:32,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:32,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:32,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:32,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:32,382 INFO L82 PathProgramCache]: Analyzing trace with hash -127775619, now seen corresponding path program 1 times [2018-12-08 09:34:32,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:32,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:32,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:32,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:34:32,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:32,574 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:34:32,574 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:34:32,574 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:34:32,574 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:34:32,574 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:34:32,574 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:34:32,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:34:32,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:34:32,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-08 09:34:32,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:34:32,574 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:34:32,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:32,871 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:34:32,871 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:34:32,871 INFO L122 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 [2018-12-08 09:34:32,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:32,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:32,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:32,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:32,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:32,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:32,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:32,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:32,873 INFO L122 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 [2018-12-08 09:34:32,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:32,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:32,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:32,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:32,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:32,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:32,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:32,876 INFO L122 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 [2018-12-08 09:34:32,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:32,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:32,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:32,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:32,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:32,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:32,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:32,880 INFO L122 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 [2018-12-08 09:34:32,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:32,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:32,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:32,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:32,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:32,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:32,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:32,884 INFO L122 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 [2018-12-08 09:34:32,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:32,884 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:34:32,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:32,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:32,885 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:34:32,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:32,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:32,887 INFO L122 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 [2018-12-08 09:34:32,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:32,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:32,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:32,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:32,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:32,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:32,892 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:34:32,896 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 09:34:32,896 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 09:34:32,897 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:34:32,898 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:34:32,898 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:34:32,898 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-12-08 09:34:32,912 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 09:34:32,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:34:32,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:32,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:32,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:32,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:32,940 INFO L478 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 27 treesize of output 30 [2018-12-08 09:34:32,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:32,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 [2018-12-08 09:34:32,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:32,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:32,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:32,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-12-08 09:34:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:32,956 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 [2018-12-08 09:34:32,956 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-12-08 09:34:33,005 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 65 states and 85 transitions. Complement of second has 9 states. [2018-12-08 09:34:33,006 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 [2018-12-08 09:34:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 09:34:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-12-08 09:34:33,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 6 letters. Loop has 5 letters. [2018-12-08 09:34:33,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:33,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-08 09:34:33,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:33,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 6 letters. Loop has 10 letters. [2018-12-08 09:34:33,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:33,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 85 transitions. [2018-12-08 09:34:33,007 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-12-08 09:34:33,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 84 transitions. [2018-12-08 09:34:33,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-08 09:34:33,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-12-08 09:34:33,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 84 transitions. [2018-12-08 09:34:33,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:34:33,008 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-12-08 09:34:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 84 transitions. [2018-12-08 09:34:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-12-08 09:34:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-08 09:34:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2018-12-08 09:34:33,010 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-12-08 09:34:33,011 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-12-08 09:34:33,011 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 09:34:33,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 80 transitions. [2018-12-08 09:34:33,011 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-12-08 09:34:33,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:34:33,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:34:33,011 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:34:33,012 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2018-12-08 09:34:33,012 INFO L794 eck$LassoCheckResult]: Stem: 634#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 632#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 633#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 643#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 671#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 664#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 660#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 661#L559-2 [2018-12-08 09:34:33,012 INFO L796 eck$LassoCheckResult]: Loop: 661#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 672#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 635#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 636#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 647#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 676#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 648#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 649#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 666#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 667#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 661#L559-2 [2018-12-08 09:34:33,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:33,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849423, now seen corresponding path program 2 times [2018-12-08 09:34:33,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:33,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:33,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:33,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:33,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:33,020 INFO L82 PathProgramCache]: Analyzing trace with hash -552559553, now seen corresponding path program 1 times [2018-12-08 09:34:33,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:33,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:33,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:34:33,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:33,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:34:33,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:34:33,110 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 09:34:33,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:34:33,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:34:33,110 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-12-08 09:34:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:34:33,164 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2018-12-08 09:34:33,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:34:33,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 100 transitions. [2018-12-08 09:34:33,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-12-08 09:34:33,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 67 states and 83 transitions. [2018-12-08 09:34:33,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-08 09:34:33,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-08 09:34:33,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 83 transitions. [2018-12-08 09:34:33,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:34:33,167 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-12-08 09:34:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 83 transitions. [2018-12-08 09:34:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2018-12-08 09:34:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-08 09:34:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2018-12-08 09:34:33,170 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2018-12-08 09:34:33,170 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2018-12-08 09:34:33,170 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 09:34:33,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 59 transitions. [2018-12-08 09:34:33,170 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-12-08 09:34:33,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:34:33,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:34:33,171 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:34:33,171 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:34:33,171 INFO L794 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 789#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 790#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 824#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 823#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 816#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 814#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 800#L559-2 [2018-12-08 09:34:33,171 INFO L796 eck$LassoCheckResult]: Loop: 800#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 801#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 791#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 792#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 804#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 800#L559-2 [2018-12-08 09:34:33,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849423, now seen corresponding path program 3 times [2018-12-08 09:34:33,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:33,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:33,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:33,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:33,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:33,182 INFO L82 PathProgramCache]: Analyzing trace with hash 35409683, now seen corresponding path program 2 times [2018-12-08 09:34:33,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:33,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:33,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:34:33,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:33,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:33,190 INFO L82 PathProgramCache]: Analyzing trace with hash 333922885, now seen corresponding path program 1 times [2018-12-08 09:34:33,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:33,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:33,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:34:33,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:33,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:34:33,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:34:33,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:33,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:33,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:33,307 INFO L478 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 33 treesize of output 34 [2018-12-08 09:34:33,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:33,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-12-08 09:34:33,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:33,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:33,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:33,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:16 [2018-12-08 09:34:33,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 17 [2018-12-08 09:34:33,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 11 [2018-12-08 09:34:33,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:33,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:33,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:33,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2018-12-08 09:34:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:33,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:34:33,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-12-08 09:34:33,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 09:34:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 09:34:33,435 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. cyclomatic complexity: 18 Second operand 10 states. [2018-12-08 09:34:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:34:33,492 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-12-08 09:34:33,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 09:34:33,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2018-12-08 09:34:33,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-12-08 09:34:33,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 50 states and 61 transitions. [2018-12-08 09:34:33,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-08 09:34:33,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-08 09:34:33,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 61 transitions. [2018-12-08 09:34:33,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:34:33,494 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-12-08 09:34:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 61 transitions. [2018-12-08 09:34:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-08 09:34:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-08 09:34:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-12-08 09:34:33,495 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-12-08 09:34:33,495 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-12-08 09:34:33,495 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 09:34:33,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 61 transitions. [2018-12-08 09:34:33,496 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-12-08 09:34:33,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:34:33,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:34:33,496 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:34:33,496 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:34:33,496 INFO L794 eck$LassoCheckResult]: Stem: 947#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 941#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 942#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 959#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 960#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 956#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 957#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 964#L559-2 [2018-12-08 09:34:33,496 INFO L796 eck$LassoCheckResult]: Loop: 964#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 977#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 974#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 971#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 962#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 964#L559-2 [2018-12-08 09:34:33,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:33,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849425, now seen corresponding path program 1 times [2018-12-08 09:34:33,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:33,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:33,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:33,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:33,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash 35409939, now seen corresponding path program 1 times [2018-12-08 09:34:33,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:33,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:33,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:33,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:33,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:33,511 INFO L82 PathProgramCache]: Analyzing trace with hash 391181443, now seen corresponding path program 2 times [2018-12-08 09:34:33,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:33,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:33,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:33,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:33,697 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2018-12-08 09:34:33,731 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:34:33,731 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:34:33,731 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:34:33,731 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:34:33,731 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:34:33,731 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:34:33,731 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:34:33,731 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:34:33,731 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-08 09:34:33,731 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:34:33,732 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:34:33,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:33,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,016 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:34:34,016 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:34:34,016 INFO L122 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 [2018-12-08 09:34:34,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,017 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:34:34,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,017 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:34:34,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:34,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:34,020 INFO L122 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 [2018-12-08 09:34:34,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:34,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:34,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:34,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:34,026 INFO L122 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 [2018-12-08 09:34:34,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:34,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:34,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:34,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:34,029 INFO L122 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 [2018-12-08 09:34:34,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,029 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:34:34,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,032 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:34:34,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:34,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:34,034 INFO L122 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 [2018-12-08 09:34:34,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:34,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:34,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:34,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:34,037 INFO L122 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 [2018-12-08 09:34:34,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:34,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:34,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:34,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:34,039 INFO L122 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 [2018-12-08 09:34:34,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:34,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:34,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:34,042 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:34:34,043 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 09:34:34,043 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 09:34:34,044 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:34:34,044 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:34:34,044 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:34:34,044 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2018-12-08 09:34:34,060 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 09:34:34,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:34:34,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:34,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:34,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:34,108 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 [2018-12-08 09:34:34,109 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 61 transitions. cyclomatic complexity: 16 Second operand 6 states. [2018-12-08 09:34:34,151 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 61 transitions. cyclomatic complexity: 16. Second operand 6 states. Result 78 states and 95 transitions. Complement of second has 11 states. [2018-12-08 09:34:34,151 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 [2018-12-08 09:34:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 09:34:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-08 09:34:34,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 7 letters. Loop has 5 letters. [2018-12-08 09:34:34,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:34,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2018-12-08 09:34:34,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:34,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 7 letters. Loop has 10 letters. [2018-12-08 09:34:34,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:34,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 95 transitions. [2018-12-08 09:34:34,152 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2018-12-08 09:34:34,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 73 states and 89 transitions. [2018-12-08 09:34:34,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-12-08 09:34:34,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-12-08 09:34:34,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 89 transitions. [2018-12-08 09:34:34,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:34:34,153 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 89 transitions. [2018-12-08 09:34:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 89 transitions. [2018-12-08 09:34:34,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2018-12-08 09:34:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-08 09:34:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2018-12-08 09:34:34,155 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2018-12-08 09:34:34,155 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2018-12-08 09:34:34,155 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 09:34:34,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 80 transitions. [2018-12-08 09:34:34,156 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2018-12-08 09:34:34,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:34:34,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:34:34,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-12-08 09:34:34,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:34:34,157 INFO L794 eck$LassoCheckResult]: Stem: 1187#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1181#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1182#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1224#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1221#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1218#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 1216#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 1213#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1214#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1238#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1242#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1207#L552 [2018-12-08 09:34:34,157 INFO L796 eck$LassoCheckResult]: Loop: 1207#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 1239#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1240#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1212#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1208#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1207#L552 [2018-12-08 09:34:34,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:34,157 INFO L82 PathProgramCache]: Analyzing trace with hash -125928585, now seen corresponding path program 1 times [2018-12-08 09:34:34,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:34,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:34,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:34,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:34:34,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:34,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash 51012381, now seen corresponding path program 2 times [2018-12-08 09:34:34,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:34,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:34,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:34,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:34,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:34,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1455202663, now seen corresponding path program 1 times [2018-12-08 09:34:34,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:34,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:34,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:34:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:34,419 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 86 [2018-12-08 09:34:34,452 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:34:34,452 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:34:34,452 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:34:34,452 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:34:34,452 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:34:34,452 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:34:34,452 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:34:34,452 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:34:34,453 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration8_Lasso [2018-12-08 09:34:34,453 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:34:34,453 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:34:34,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:34,752 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:34:34,752 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:34:34,752 INFO L122 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 [2018-12-08 09:34:34,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:34,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:34,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:34,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:34,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:34,754 INFO L122 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 [2018-12-08 09:34:34,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:34,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:34,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:34,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:34,756 INFO L122 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 [2018-12-08 09:34:34,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:34,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:34,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:34,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:34,759 INFO L122 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 [2018-12-08 09:34:34,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,759 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:34:34,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,760 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:34:34,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:34,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:34,762 INFO L122 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 [2018-12-08 09:34:34,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:34,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:34,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:34,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:34,767 INFO L122 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 [2018-12-08 09:34:34,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,768 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:34:34,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,768 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:34:34,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:34,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:34,770 INFO L122 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 [2018-12-08 09:34:34,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:34,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:34,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:34,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:34,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:34,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:34,773 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:34:34,775 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 09:34:34,776 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 09:34:34,776 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:34:34,776 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:34:34,776 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:34:34,776 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 Supporting invariants [] [2018-12-08 09:34:34,793 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 09:34:34,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:34:34,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:34,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:34,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-08 09:34:34,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:34,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:34,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-12-08 09:34:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:34,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:34,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:34,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-12-08 09:34:34,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:34,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 19 [2018-12-08 09:34:34,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:34,846 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 09:34:34,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 09:34:34,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:34,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:34,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:34,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:34,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-12-08 09:34:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:34,875 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-08 09:34:34,875 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-12-08 09:34:34,928 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 169 states and 208 transitions. Complement of second has 10 states. [2018-12-08 09:34:34,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 09:34:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 09:34:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-12-08 09:34:34,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-08 09:34:34,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:34,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 16 letters. Loop has 5 letters. [2018-12-08 09:34:34,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:34,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 10 letters. [2018-12-08 09:34:34,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:34,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 208 transitions. [2018-12-08 09:34:34,931 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 34 [2018-12-08 09:34:34,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 149 states and 187 transitions. [2018-12-08 09:34:34,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-12-08 09:34:34,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-12-08 09:34:34,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 187 transitions. [2018-12-08 09:34:34,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:34:34,932 INFO L705 BuchiCegarLoop]: Abstraction has 149 states and 187 transitions. [2018-12-08 09:34:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 187 transitions. [2018-12-08 09:34:34,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 122. [2018-12-08 09:34:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-08 09:34:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 157 transitions. [2018-12-08 09:34:34,936 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2018-12-08 09:34:34,936 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2018-12-08 09:34:34,936 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 09:34:34,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 157 transitions. [2018-12-08 09:34:34,937 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2018-12-08 09:34:34,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:34:34,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:34:34,937 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-08 09:34:34,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:34:34,937 INFO L794 eck$LassoCheckResult]: Stem: 1548#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1542#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1543#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1601#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1604#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1605#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1610#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 1611#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1554#L550-1 [2018-12-08 09:34:34,937 INFO L796 eck$LassoCheckResult]: Loop: 1554#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1544#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1545#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1549#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 1550#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1554#L550-1 [2018-12-08 09:34:34,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:34,938 INFO L82 PathProgramCache]: Analyzing trace with hash 177749336, now seen corresponding path program 2 times [2018-12-08 09:34:34,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:34,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:34,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:34,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:34,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:34,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 3 times [2018-12-08 09:34:34,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:34,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:34,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:34,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:34:34,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:34,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:34,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2100968094, now seen corresponding path program 1 times [2018-12-08 09:34:34,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:34,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:34,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:34,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:34:34,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:35,243 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2018-12-08 09:34:35,464 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2018-12-08 09:34:35,466 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:34:35,466 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:34:35,466 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:34:35,466 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:34:35,466 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:34:35,466 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:34:35,466 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:34:35,466 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:34:35,466 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration9_Lasso [2018-12-08 09:34:35,466 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:34:35,467 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:34:35,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,686 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-12-08 09:34:35,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:35,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,013 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:34:36,013 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:34:36,013 INFO L122 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 [2018-12-08 09:34:36,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:36,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:36,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:36,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,014 INFO L122 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 [2018-12-08 09:34:36,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:36,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:36,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:36,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,016 INFO L122 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 [2018-12-08 09:34:36,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,017 INFO L122 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 [2018-12-08 09:34:36,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,019 INFO L122 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 [2018-12-08 09:34:36,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,021 INFO L122 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 [2018-12-08 09:34:36,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:36,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:36,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:36,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,023 INFO L122 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 [2018-12-08 09:34:36,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:36,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:36,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:36,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,024 INFO L122 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 [2018-12-08 09:34:36,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:36,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:36,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:36,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,025 INFO L122 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 [2018-12-08 09:34:36,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:36,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:36,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:36,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,026 INFO L122 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 [2018-12-08 09:34:36,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,028 INFO L122 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 [2018-12-08 09:34:36,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,031 INFO L122 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 [2018-12-08 09:34:36,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,031 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:34:36,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,032 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:34:36,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,034 INFO L122 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 [2018-12-08 09:34:36,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,034 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:34:36,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,035 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:34:36,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,037 INFO L122 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 [2018-12-08 09:34:36,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,040 INFO L122 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 [2018-12-08 09:34:36,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,043 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:34:36,044 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 09:34:36,044 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 09:34:36,044 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:34:36,045 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:34:36,045 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:34:36,045 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-12-08 09:34:36,072 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 09:34:36,073 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:34:36,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:36,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:36,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:36,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:36,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-08 09:34:36,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:36,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 22 [2018-12-08 09:34:36,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:36,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:36,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:36,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-12-08 09:34:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:36,131 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 [2018-12-08 09:34:36,131 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2018-12-08 09:34:36,151 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48. Second operand 5 states. Result 147 states and 182 transitions. Complement of second has 9 states. [2018-12-08 09:34:36,151 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 [2018-12-08 09:34:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 09:34:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-08 09:34:36,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2018-12-08 09:34:36,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:36,152 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 09:34:36,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:36,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:36,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:36,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:36,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-08 09:34:36,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:36,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 22 [2018-12-08 09:34:36,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:36,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:36,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:36,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-12-08 09:34:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:36,206 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 [2018-12-08 09:34:36,206 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2018-12-08 09:34:36,233 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48. Second operand 5 states. Result 145 states and 182 transitions. Complement of second has 9 states. [2018-12-08 09:34:36,233 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 [2018-12-08 09:34:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 09:34:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2018-12-08 09:34:36,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 5 letters. [2018-12-08 09:34:36,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:36,233 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 09:34:36,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:36,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:36,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:36,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:36,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-08 09:34:36,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:36,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 22 [2018-12-08 09:34:36,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:36,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:36,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:36,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-12-08 09:34:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:36,284 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 [2018-12-08 09:34:36,284 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2018-12-08 09:34:36,304 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48. Second operand 5 states. Result 214 states and 257 transitions. Complement of second has 8 states. [2018-12-08 09:34:36,304 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 [2018-12-08 09:34:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 09:34:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-12-08 09:34:36,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 5 letters. [2018-12-08 09:34:36,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:36,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 5 letters. [2018-12-08 09:34:36,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:36,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 10 letters. [2018-12-08 09:34:36,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:36,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 257 transitions. [2018-12-08 09:34:36,306 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-12-08 09:34:36,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 157 states and 195 transitions. [2018-12-08 09:34:36,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-12-08 09:34:36,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-12-08 09:34:36,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 195 transitions. [2018-12-08 09:34:36,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:34:36,308 INFO L705 BuchiCegarLoop]: Abstraction has 157 states and 195 transitions. [2018-12-08 09:34:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 195 transitions. [2018-12-08 09:34:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 122. [2018-12-08 09:34:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-08 09:34:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions. [2018-12-08 09:34:36,310 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2018-12-08 09:34:36,310 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2018-12-08 09:34:36,310 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 09:34:36,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 154 transitions. [2018-12-08 09:34:36,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-12-08 09:34:36,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:34:36,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:34:36,311 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1] [2018-12-08 09:34:36,311 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:34:36,311 INFO L794 eck$LassoCheckResult]: Stem: 2393#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2387#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 2388#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2432#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2433#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2476#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2427#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 2426#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2466#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2465#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2464#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2408#L559 [2018-12-08 09:34:36,311 INFO L796 eck$LassoCheckResult]: Loop: 2408#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 2409#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2500#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2499#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2497#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2408#L559 [2018-12-08 09:34:36,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:36,311 INFO L82 PathProgramCache]: Analyzing trace with hash -125928577, now seen corresponding path program 3 times [2018-12-08 09:34:36,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:36,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:36,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:36,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:36,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:36,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:36,320 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 3 times [2018-12-08 09:34:36,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:36,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:36,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:36,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:34:36,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:36,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:36,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1691624047, now seen corresponding path program 1 times [2018-12-08 09:34:36,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:36,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:36,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:36,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:34:36,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:36,565 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2018-12-08 09:34:36,602 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:34:36,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:34:36,603 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:34:36,603 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:34:36,603 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:34:36,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:34:36,603 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:34:36,603 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:34:36,603 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration10_Lasso [2018-12-08 09:34:36,603 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:34:36,603 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:34:36,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:34:36,886 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:34:36,886 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:34:36,886 INFO L122 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 [2018-12-08 09:34:36,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,888 INFO L122 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 [2018-12-08 09:34:36,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:36,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:36,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:36,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,889 INFO L122 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 [2018-12-08 09:34:36,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:36,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:36,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:36,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,890 INFO L122 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 [2018-12-08 09:34:36,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:36,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:36,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:36,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,891 INFO L122 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 [2018-12-08 09:34:36,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,892 INFO L122 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 [2018-12-08 09:34:36,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:34:36,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:34:36,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:34:36,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,893 INFO L122 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 [2018-12-08 09:34:36,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,895 INFO L122 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 [2018-12-08 09:34:36,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,895 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:34:36,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,895 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:34:36,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,897 INFO L122 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 [2018-12-08 09:34:36,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,899 INFO L122 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 [2018-12-08 09:34:36,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,902 INFO L122 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 [2018-12-08 09:34:36,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,906 INFO L122 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 [2018-12-08 09:34:36,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:34:36,908 INFO L122 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 [2018-12-08 09:34:36,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:34:36,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:34:36,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:34:36,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:34:36,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:34:36,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:34:36,911 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:34:36,913 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 09:34:36,913 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 09:34:36,913 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:34:36,913 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:34:36,914 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:34:36,914 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7 Supporting invariants [] [2018-12-08 09:34:36,951 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 09:34:36,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:34:36,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:36,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:36,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:36,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:36,991 INFO L478 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 27 treesize of output 30 [2018-12-08 09:34:36,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:36,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 [2018-12-08 09:34:36,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:36,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:36,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:36,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-12-08 09:34:37,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:37,009 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 [2018-12-08 09:34:37,009 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2018-12-08 09:34:37,032 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 130 states and 164 transitions. Complement of second has 7 states. [2018-12-08 09:34:37,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 09:34:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 09:34:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-08 09:34:37,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-08 09:34:37,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:37,033 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 09:34:37,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:37,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:37,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:37,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:37,057 INFO L478 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 27 treesize of output 30 [2018-12-08 09:34:37,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:37,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 [2018-12-08 09:34:37,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-12-08 09:34:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:37,074 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 09:34:37,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2018-12-08 09:34:37,102 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 130 states and 164 transitions. Complement of second has 7 states. [2018-12-08 09:34:37,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 09:34:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 09:34:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-08 09:34:37,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-08 09:34:37,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:37,103 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 09:34:37,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:37,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:37,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:37,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:37,127 INFO L478 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 27 treesize of output 30 [2018-12-08 09:34:37,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:37,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 [2018-12-08 09:34:37,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-12-08 09:34:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:37,141 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 3 loop predicates [2018-12-08 09:34:37,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2018-12-08 09:34:37,159 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 159 states and 196 transitions. Complement of second has 6 states. [2018-12-08 09:34:37,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 09:34:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 09:34:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-08 09:34:37,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-08 09:34:37,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:37,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 5 letters. [2018-12-08 09:34:37,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:37,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 10 letters. [2018-12-08 09:34:37,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:34:37,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 196 transitions. [2018-12-08 09:34:37,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-12-08 09:34:37,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 129 states and 160 transitions. [2018-12-08 09:34:37,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-12-08 09:34:37,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-12-08 09:34:37,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 160 transitions. [2018-12-08 09:34:37,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:34:37,161 INFO L705 BuchiCegarLoop]: Abstraction has 129 states and 160 transitions. [2018-12-08 09:34:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 160 transitions. [2018-12-08 09:34:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2018-12-08 09:34:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-08 09:34:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 135 transitions. [2018-12-08 09:34:37,165 INFO L728 BuchiCegarLoop]: Abstraction has 108 states and 135 transitions. [2018-12-08 09:34:37,165 INFO L608 BuchiCegarLoop]: Abstraction has 108 states and 135 transitions. [2018-12-08 09:34:37,165 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-08 09:34:37,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 135 transitions. [2018-12-08 09:34:37,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-12-08 09:34:37,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:34:37,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:34:37,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 09:34:37,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2018-12-08 09:34:37,166 INFO L794 eck$LassoCheckResult]: Stem: 3166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3160#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 3161#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3172#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3253#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3252#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3250#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 3168#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3245#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3243#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3242#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 3179#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 3180#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3266#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3178#L550-3 [2018-12-08 09:34:37,166 INFO L796 eck$LassoCheckResult]: Loop: 3178#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3192#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3183#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 3188#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3186#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3187#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3264#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3169#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 3170#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3177#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3178#L550-3 [2018-12-08 09:34:37,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:37,166 INFO L82 PathProgramCache]: Analyzing trace with hash -705255448, now seen corresponding path program 2 times [2018-12-08 09:34:37,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:37,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:37,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:37,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:34:37,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:34:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:37,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:34:37,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee70f2d0-9d5b-447a-be6d-2d0c625c3242/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:34:37,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 09:34:37,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 09:34:37,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 09:34:37,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:34:37,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-08 09:34:37,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-12-08 09:34:37,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:37,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-12-08 09:34:37,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:34:37,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 19 [2018-12-08 09:34:37,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,290 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 09:34:37,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 09:34:37,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:9 [2018-12-08 09:34:37,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-12-08 09:34:37,321 INFO L478 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 11 treesize of output 7 [2018-12-08 09:34:37,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:34:37,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-08 09:34:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:34:37,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:34:37,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-12-08 09:34:37,340 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 09:34:37,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:34:37,341 INFO L82 PathProgramCache]: Analyzing trace with hash 757834051, now seen corresponding path program 1 times [2018-12-08 09:34:37,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:34:37,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:34:37,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:37,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:34:37,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:34:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:34:37,496 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-12-08 09:34:37,630 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2018-12-08 09:34:37,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 09:34:37,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-08 09:34:37,630 INFO L87 Difference]: Start difference. First operand 108 states and 135 transitions. cyclomatic complexity: 34 Second operand 11 states. [2018-12-08 09:34:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:34:37,725 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2018-12-08 09:34:37,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 09:34:37,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 103 transitions. [2018-12-08 09:34:37,725 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:34:37,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 0 states and 0 transitions. [2018-12-08 09:34:37,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 09:34:37,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 09:34:37,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 09:34:37,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:34:37,726 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:34:37,726 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:34:37,726 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:34:37,726 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-08 09:34:37,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 09:34:37,726 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:34:37,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 09:34:37,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 09:34:37 BoogieIcfgContainer [2018-12-08 09:34:37,730 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 09:34:37,731 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 09:34:37,731 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 09:34:37,731 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 09:34:37,731 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:34:30" (3/4) ... [2018-12-08 09:34:37,733 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 09:34:37,733 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 09:34:37,734 INFO L168 Benchmark]: Toolchain (without parser) took 7864.81 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.3 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -125.3 MB). Peak memory consumption was 172.0 MB. Max. memory is 11.5 GB. [2018-12-08 09:34:37,734 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:34:37,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -134.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-08 09:34:37,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 09:34:37,735 INFO L168 Benchmark]: Boogie Preprocessor took 13.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:34:37,735 INFO L168 Benchmark]: RCFGBuilder took 137.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-08 09:34:37,735 INFO L168 Benchmark]: BuchiAutomizer took 7418.65 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.9 MB). Peak memory consumption was 185.7 MB. Max. memory is 11.5 GB. [2018-12-08 09:34:37,735 INFO L168 Benchmark]: Witness Printer took 2.61 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:34:37,737 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -134.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.12 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 137.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7418.65 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.9 MB). Peak memory consumption was 185.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.61 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 (4 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.3s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 5.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 125 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 122 states and ocurred in iteration 8. Nontrivial modules had stage [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 118 SDtfs, 152 SDslu, 64 SDs, 0 SdLazy, 501 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital252 mio100 ax107 hnf100 lsp81 ukn66 mio100 lsp35 div100 bol103 ite100 ukn100 eq180 hnf88 smp97 dnf105 smp95 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...