./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/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 9016787135830d25851d4a1126db5f65005e4eb5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:05:32,237 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:05:32,238 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:05:32,245 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:05:32,245 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:05:32,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:05:32,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:05:32,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:05:32,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:05:32,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:05:32,248 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:05:32,248 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:05:32,249 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:05:32,249 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:05:32,250 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:05:32,250 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:05:32,251 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:05:32,252 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:05:32,253 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:05:32,254 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:05:32,255 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:05:32,256 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:05:32,257 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:05:32,257 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:05:32,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:05:32,258 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:05:32,259 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:05:32,259 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:05:32,260 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:05:32,261 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:05:32,261 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:05:32,261 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:05:32,262 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:05:32,262 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:05:32,262 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:05:32,263 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:05:32,263 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 14:05:32,271 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:05:32,271 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:05:32,272 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:05:32,272 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:05:32,272 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:05:32,273 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 14:05:32,273 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 14:05:32,273 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 14:05:32,273 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 14:05:32,273 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 14:05:32,273 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 14:05:32,273 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:05:32,274 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:05:32,274 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:05:32,274 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:05:32,274 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 14:05:32,274 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 14:05:32,274 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 14:05:32,274 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:05:32,274 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 14:05:32,275 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:05:32,275 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 14:05:32,275 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:05:32,275 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:05:32,275 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 14:05:32,275 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:05:32,275 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:05:32,276 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 14:05:32,276 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 14:05:32,276 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_04e1c430-943e-4243-ae70-df3cb187e1ec/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 -> 9016787135830d25851d4a1126db5f65005e4eb5 [2018-11-23 14:05:32,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:05:32,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:05:32,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:05:32,314 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:05:32,314 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:05:32,315 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca_true-termination.c.i [2018-11-23 14:05:32,359 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/bin-2019/uautomizer/data/320edf598/7eec1a67d4b94df99a59661f0a96de77/FLAG966678ce9 [2018-11-23 14:05:32,792 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:05:32,792 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/sv-benchmarks/c/termination-memory-alloca/count_down-alloca_true-termination.c.i [2018-11-23 14:05:32,799 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/bin-2019/uautomizer/data/320edf598/7eec1a67d4b94df99a59661f0a96de77/FLAG966678ce9 [2018-11-23 14:05:32,811 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/bin-2019/uautomizer/data/320edf598/7eec1a67d4b94df99a59661f0a96de77 [2018-11-23 14:05:32,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:05:32,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:05:32,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:05:32,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:05:32,819 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:05:32,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:05:32" (1/1) ... [2018-11-23 14:05:32,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7917cefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:32, skipping insertion in model container [2018-11-23 14:05:32,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:05:32" (1/1) ... [2018-11-23 14:05:32,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:05:32,859 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:05:33,039 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:05:33,047 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:05:33,119 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:05:33,148 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:05:33,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:33 WrapperNode [2018-11-23 14:05:33,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:05:33,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:05:33,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:05:33,149 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:05:33,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:33" (1/1) ... [2018-11-23 14:05:33,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:33" (1/1) ... [2018-11-23 14:05:33,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:05:33,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:05:33,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:05:33,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:05:33,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:33" (1/1) ... [2018-11-23 14:05:33,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:33" (1/1) ... [2018-11-23 14:05:33,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:33" (1/1) ... [2018-11-23 14:05:33,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:33" (1/1) ... [2018-11-23 14:05:33,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:33" (1/1) ... [2018-11-23 14:05:33,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:33" (1/1) ... [2018-11-23 14:05:33,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:33" (1/1) ... [2018-11-23 14:05:33,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:05:33,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:05:33,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:05:33,191 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:05:33,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/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-11-23 14:05:33,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:05:33,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:05:33,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:05:33,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:05:33,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:05:33,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:05:33,388 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:05:33,388 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 14:05:33,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:05:33 BoogieIcfgContainer [2018-11-23 14:05:33,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:05:33,389 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 14:05:33,389 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 14:05:33,391 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 14:05:33,392 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:05:33,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:05:32" (1/3) ... [2018-11-23 14:05:33,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2942017d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:05:33, skipping insertion in model container [2018-11-23 14:05:33,393 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:05:33,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:33" (2/3) ... [2018-11-23 14:05:33,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2942017d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:05:33, skipping insertion in model container [2018-11-23 14:05:33,393 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:05:33,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:05:33" (3/3) ... [2018-11-23 14:05:33,395 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_down-alloca_true-termination.c.i [2018-11-23 14:05:33,430 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:05:33,430 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 14:05:33,430 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 14:05:33,430 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 14:05:33,430 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:05:33,431 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:05:33,431 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 14:05:33,431 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:05:33,431 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 14:05:33,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 14:05:33,455 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 14:05:33,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:05:33,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:05:33,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 14:05:33,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 14:05:33,459 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 14:05:33,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 14:05:33,461 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 14:05:33,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:05:33,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:05:33,461 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 14:05:33,461 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 14:05:33,467 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 12#L551true assume !(main_~length~0 < 1); 18#L551-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 9#L553true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 13#L554-3true [2018-11-23 14:05:33,467 INFO L796 eck$LassoCheckResult]: Loop: 13#L554-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 5#L556true assume main_~val~0 < 0;main_~val~0 := 0; 7#L556-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 11#L554-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 13#L554-3true [2018-11-23 14:05:33,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:33,472 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-23 14:05:33,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:33,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:33,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:33,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:33,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:33,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:33,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2018-11-23 14:05:33,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:33,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:33,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:33,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:33,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:33,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:33,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2018-11-23 14:05:33,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:33,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:33,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:33,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:33,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:33,768 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:05:33,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:05:33,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:05:33,769 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:05:33,769 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:05:33,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:05:33,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:05:33,769 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:05:33,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-23 14:05:33,769 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:05:33,770 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:05:33,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:33,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:34,055 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:05:34,058 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:05:34,059 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-11-23 14:05:34,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:34,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:34,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:34,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,066 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-11-23 14:05:34,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:34,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:34,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:34,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,069 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-11-23 14:05:34,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:34,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:34,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:34,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,072 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-11-23 14:05:34,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:34,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:34,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:34,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,074 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-11-23 14:05:34,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:34,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:34,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,081 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-11-23 14:05:34,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:34,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:34,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,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-11-23 14:05:34,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:34,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:34,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:34,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,094 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-11-23 14:05:34,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:34,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:34,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:34,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,097 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-11-23 14:05:34,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:34,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:34,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,105 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-11-23 14:05:34,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:34,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:34,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,110 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-11-23 14:05:34,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:34,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:34,157 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:05:34,178 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 14:05:34,178 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 14:05:34,180 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:05:34,181 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:05:34,182 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:05:34,182 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-23 14:05:34,206 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 14:05:34,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:34,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:34,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:34,265 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:05:34,266 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2018-11-23 14:05:34,304 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2018-11-23 14:05:34,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 14:05:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:05:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-23 14:05:34,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 14:05:34,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:34,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 14:05:34,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:34,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 14:05:34,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:34,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2018-11-23 14:05:34,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 14:05:34,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-11-23 14:05:34,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 14:05:34,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 14:05:34,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-23 14:05:34,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:05:34,315 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 14:05:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-23 14:05:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 14:05:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 14:05:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-23 14:05:34,331 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 14:05:34,332 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 14:05:34,332 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 14:05:34,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-23 14:05:34,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 14:05:34,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:05:34,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:05:34,333 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:34,333 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 14:05:34,333 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 133#L551 assume !(main_~length~0 < 1); 138#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 134#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 135#L554-3 assume !(main_~i~0 < main_~length~0); 139#L554-4 main_~j~0 := 0; 127#L561-3 [2018-11-23 14:05:34,333 INFO L796 eck$LassoCheckResult]: Loop: 127#L561-3 assume !!(main_~j~0 < main_~length~0); 128#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 140#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 141#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 127#L561-3 [2018-11-23 14:05:34,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:34,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2018-11-23 14:05:34,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:34,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:34,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:34,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:34,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:34,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:05:34,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:05:34,368 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:05:34,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:34,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2018-11-23 14:05:34,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:34,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:34,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:34,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:34,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:34,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:05:34,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:05:34,414 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-23 14:05:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:34,436 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 14:05:34,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:05:34,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 14:05:34,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 14:05:34,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2018-11-23 14:05:34,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 14:05:34,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 14:05:34,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-11-23 14:05:34,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:05:34,439 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-23 14:05:34,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-11-23 14:05:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-23 14:05:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 14:05:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-23 14:05:34,441 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 14:05:34,441 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 14:05:34,441 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 14:05:34,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-23 14:05:34,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 14:05:34,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:05:34,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:05:34,442 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:34,442 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 14:05:34,442 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 173#L551 assume !(main_~length~0 < 1); 178#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 174#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 175#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 169#L556 assume !(main_~val~0 < 0); 170#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 171#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 177#L554-3 assume !(main_~i~0 < main_~length~0); 179#L554-4 main_~j~0 := 0; 167#L561-3 [2018-11-23 14:05:34,442 INFO L796 eck$LassoCheckResult]: Loop: 167#L561-3 assume !!(main_~j~0 < main_~length~0); 168#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 180#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 181#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 167#L561-3 [2018-11-23 14:05:34,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:34,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2018-11-23 14:05:34,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:34,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:34,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:34,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:34,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:34,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:34,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2018-11-23 14:05:34,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:34,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:34,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:34,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:34,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:34,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:34,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2018-11-23 14:05:34,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:34,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:34,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:34,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:05:34,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:34,622 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:05:34,622 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:05:34,622 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:05:34,622 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:05:34,623 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:05:34,623 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:05:34,623 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:05:34,623 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:05:34,623 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 14:05:34,623 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:05:34,623 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:05:34,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:34,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:34,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:34,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:34,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:34,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:34,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:34,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:34,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-11-23 14:05:34,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-11-23 14:05:34,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-11-23 14:05:34,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-11-23 14:05:34,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-11-23 14:05:34,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-11-23 14:05:34,866 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:05:34,866 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:05:34,867 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-11-23 14:05:34,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:34,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:34,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:34,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,869 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-11-23 14:05:34,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:34,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:34,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:34,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,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-11-23 14:05:34,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:34,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:34,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:34,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,872 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-11-23 14:05:34,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,872 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:05:34,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,873 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:05:34,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:34,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,878 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-11-23 14:05:34,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:34,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:34,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,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-11-23 14:05:34,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:34,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:34,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:34,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-11-23 14:05:34,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:34,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:34,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:34,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:34,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:34,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:34,904 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:05:34,921 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 14:05:34,921 INFO L444 ModelExtractionUtils]: 13 out of 25 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-23 14:05:34,922 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:05:34,923 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:05:34,923 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:05:34,923 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-23 14:05:34,944 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 14:05:34,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:34,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:34,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:34,984 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:05:34,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 14:05:34,996 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 4 states. [2018-11-23 14:05:34,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 14:05:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:05:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 14:05:34,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-23 14:05:34,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:34,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-23 14:05:34,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:34,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-23 14:05:34,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:34,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-11-23 14:05:34,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 14:05:35,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 25 transitions. [2018-11-23 14:05:35,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 14:05:35,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 14:05:35,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2018-11-23 14:05:35,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:05:35,003 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-23 14:05:35,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2018-11-23 14:05:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-23 14:05:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 14:05:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-11-23 14:05:35,004 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-23 14:05:35,004 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-23 14:05:35,005 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 14:05:35,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-11-23 14:05:35,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 14:05:35,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:05:35,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:05:35,006 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:35,006 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:05:35,006 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 286#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 287#L551 assume !(main_~length~0 < 1); 293#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 288#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 289#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 283#L556 assume !(main_~val~0 < 0); 284#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 285#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 291#L554-3 assume !(main_~i~0 < main_~length~0); 292#L554-4 main_~j~0 := 0; 279#L561-3 assume !!(main_~j~0 < main_~length~0); 281#L562-3 [2018-11-23 14:05:35,010 INFO L796 eck$LassoCheckResult]: Loop: 281#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 294#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem8;havoc main_#t~post9; 281#L562-3 [2018-11-23 14:05:35,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:35,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2018-11-23 14:05:35,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:35,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:35,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:35,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2018-11-23 14:05:35,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:35,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:35,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:35,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:35,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:35,028 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2018-11-23 14:05:35,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:35,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:35,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:35,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:35,160 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:05:35,161 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:05:35,161 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:05:35,161 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:05:35,161 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:05:35,161 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:05:35,161 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:05:35,161 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:05:35,161 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 14:05:35,161 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:05:35,161 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:05:35,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:35,405 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:05:35,405 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:05:35,405 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-11-23 14:05:35,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:35,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:35,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:35,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:35,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:35,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:35,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:35,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:35,407 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-11-23 14:05:35,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:35,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:35,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:35,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:35,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:35,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:35,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:35,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:35,409 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-11-23 14:05:35,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:35,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:35,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:35,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:35,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:35,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:35,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:35,415 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-11-23 14:05:35,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:35,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:35,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:35,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:35,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:35,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:35,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:35,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:35,416 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-11-23 14:05:35,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:35,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:35,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:35,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:35,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:35,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:35,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:35,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:35,422 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-11-23 14:05:35,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:35,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:35,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:35,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:35,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:35,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:35,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:35,425 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-11-23 14:05:35,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:35,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:35,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:35,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:35,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:35,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:35,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:35,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:35,427 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-11-23 14:05:35,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:35,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:35,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:35,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:35,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:35,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:35,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:35,430 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-11-23 14:05:35,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:35,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:35,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:35,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:35,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:35,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:35,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:35,445 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-11-23 14:05:35,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:35,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:35,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:35,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:35,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:35,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:35,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:35,450 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-11-23 14:05:35,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:35,451 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:05:35,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:35,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:35,452 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:05:35,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:35,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:35,455 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-11-23 14:05:35,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:35,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:35,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:35,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:35,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:35,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:35,464 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:05:35,469 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 14:05:35,469 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 14:05:35,470 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:05:35,470 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:05:35,471 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:05:35,471 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2018-11-23 14:05:35,497 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 14:05:35,498 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 14:05:35,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:35,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:35,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:35,527 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:05:35,527 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 14:05:35,540 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 27 states and 35 transitions. Complement of second has 7 states. [2018-11-23 14:05:35,541 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-11-23 14:05:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:05:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-23 14:05:35,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-23 14:05:35,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:35,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-23 14:05:35,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:35,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-23 14:05:35,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:35,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-11-23 14:05:35,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 14:05:35,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2018-11-23 14:05:35,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 14:05:35,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 14:05:35,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2018-11-23 14:05:35,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:05:35,544 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-23 14:05:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2018-11-23 14:05:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 14:05:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 14:05:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-11-23 14:05:35,545 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-23 14:05:35,545 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-23 14:05:35,545 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 14:05:35,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2018-11-23 14:05:35,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 14:05:35,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:05:35,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:05:35,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:35,547 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:05:35,547 INFO L794 eck$LassoCheckResult]: Stem: 418#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 414#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 415#L551 assume !(main_~length~0 < 1); 420#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 416#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 417#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 411#L556 assume !(main_~val~0 < 0); 412#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 413#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 419#L554-3 assume !(main_~i~0 < main_~length~0); 421#L554-4 main_~j~0 := 0; 406#L561-3 assume !!(main_~j~0 < main_~length~0); 407#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 423#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 424#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 408#L561-3 assume !!(main_~j~0 < main_~length~0); 410#L562-3 [2018-11-23 14:05:35,547 INFO L796 eck$LassoCheckResult]: Loop: 410#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 422#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem8;havoc main_#t~post9; 410#L562-3 [2018-11-23 14:05:35,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:35,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2018-11-23 14:05:35,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:35,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:35,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:35,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:35,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:05:35,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04e1c430-943e-4243-ae70-df3cb187e1ec/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-11-23 14:05:35,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 14:05:35,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 14:05:35,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 14:05:35,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:35,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:05:35,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-11-23 14:05:35,710 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:05:35,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:35,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2018-11-23 14:05:35,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:35,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:35,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:05:35,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:35,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 14:05:35,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-23 14:05:35,737 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2018-11-23 14:05:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:35,880 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-11-23 14:05:35,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 14:05:35,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2018-11-23 14:05:35,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 14:05:35,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2018-11-23 14:05:35,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 14:05:35,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 14:05:35,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-11-23 14:05:35,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:05:35,882 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-23 14:05:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-11-23 14:05:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-23 14:05:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 14:05:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-11-23 14:05:35,884 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-23 14:05:35,884 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-23 14:05:35,884 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 14:05:35,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2018-11-23 14:05:35,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 14:05:35,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:05:35,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:05:35,885 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:35,885 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:05:35,885 INFO L794 eck$LassoCheckResult]: Stem: 561#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 557#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 558#L551 assume !(main_~length~0 < 1); 565#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 559#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 560#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 564#L556 assume !(main_~val~0 < 0); 573#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 562#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 563#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 554#L556 assume !(main_~val~0 < 0); 555#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 556#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 571#L554-3 assume !(main_~i~0 < main_~length~0); 568#L554-4 main_~j~0 := 0; 549#L561-3 assume !!(main_~j~0 < main_~length~0); 550#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 572#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 570#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 551#L561-3 assume !!(main_~j~0 < main_~length~0); 553#L562-3 [2018-11-23 14:05:35,885 INFO L796 eck$LassoCheckResult]: Loop: 553#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 566#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem8;havoc main_#t~post9; 553#L562-3 [2018-11-23 14:05:35,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:35,885 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2018-11-23 14:05:35,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:35,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:35,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:05:35,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:35,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:35,900 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2018-11-23 14:05:35,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:35,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:35,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:05:35,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:35,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2018-11-23 14:05:35,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:05:35,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:05:35,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:05:35,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:36,082 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2018-11-23 14:05:36,115 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:05:36,115 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:05:36,116 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:05:36,116 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:05:36,116 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:05:36,116 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:05:36,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:05:36,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:05:36,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-23 14:05:36,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:05:36,116 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:05:36,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:05:36,317 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:05:36,317 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:05:36,317 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-11-23 14:05:36,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:36,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:36,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:36,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:36,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:36,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:36,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:36,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:36,318 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-11-23 14:05:36,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:36,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:36,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:36,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:36,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:36,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:36,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:36,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:36,319 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-11-23 14:05:36,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:36,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:36,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:36,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:36,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:36,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:36,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:36,321 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-11-23 14:05:36,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:36,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:36,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:36,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:36,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:05:36,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:05:36,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:05:36,323 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-11-23 14:05:36,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:05:36,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:05:36,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:05:36,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:05:36,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:05:36,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:05:36,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:05:36,324 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:05:36,325 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 14:05:36,325 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 14:05:36,325 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:05:36,326 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 14:05:36,326 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:05:36,326 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_1 Supporting invariants [] [2018-11-23 14:05:36,337 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 14:05:36,337 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 14:05:36,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:36,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:36,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:36,361 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:05:36,361 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 14:05:36,370 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-11-23 14:05:36,370 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-11-23 14:05:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:05:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 14:05:36,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-11-23 14:05:36,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:36,371 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 14:05:36,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:36,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:36,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:36,393 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:05:36,393 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 14:05:36,400 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-11-23 14:05:36,400 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-11-23 14:05:36,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:05:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 14:05:36,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-11-23 14:05:36,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:36,401 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 14:05:36,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:36,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:36,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:36,435 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 2 loop predicates [2018-11-23 14:05:36,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 14:05:36,445 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2018-11-23 14:05:36,445 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-11-23 14:05:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:05:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-23 14:05:36,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2018-11-23 14:05:36,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:36,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2018-11-23 14:05:36,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:36,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-23 14:05:36,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:05:36,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2018-11-23 14:05:36,446 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:05:36,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-11-23 14:05:36,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 14:05:36,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 14:05:36,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 14:05:36,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:05:36,447 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:05:36,447 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:05:36,447 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:05:36,447 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 14:05:36,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 14:05:36,447 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:05:36,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 14:05:36,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:05:36 BoogieIcfgContainer [2018-11-23 14:05:36,451 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 14:05:36,451 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:05:36,451 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:05:36,451 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:05:36,452 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:05:33" (3/4) ... [2018-11-23 14:05:36,454 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:05:36,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:05:36,455 INFO L168 Benchmark]: Toolchain (without parser) took 3640.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -74.3 MB). Peak memory consumption was 115.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:05:36,455 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:05:36,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:05:36,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:05:36,456 INFO L168 Benchmark]: Boogie Preprocessor took 17.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:05:36,456 INFO L168 Benchmark]: RCFGBuilder took 197.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 14:05:36,457 INFO L168 Benchmark]: BuchiAutomizer took 3062.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.4 MB). Peak memory consumption was 125.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:05:36,457 INFO L168 Benchmark]: Witness Printer took 2.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:05:36,460 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.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 333.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 197.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3062.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.4 MB). Peak memory consumption was 125.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr + 4 * j] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 206 SDslu, 76 SDs, 0 SdLazy, 174 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital127 mio100 ax114 hnf98 lsp82 ukn78 mio100 lsp57 div100 bol100 ite100 ukn100 eq162 hnf90 smp92 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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...