./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/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 32bit --witnessprinter.graph.data.programhash f25230c4e3ada1aa4514132cfb87afb0e539c23b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 06:28:56,268 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:28:56,269 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:28:56,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:28:56,277 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:28:56,277 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:28:56,278 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:28:56,279 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:28:56,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:28:56,280 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:28:56,280 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:28:56,280 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:28:56,281 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:28:56,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:28:56,282 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:28:56,282 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:28:56,282 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:28:56,283 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:28:56,285 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:28:56,285 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:28:56,286 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:28:56,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:28:56,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:28:56,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:28:56,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:28:56,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:28:56,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:28:56,290 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:28:56,291 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:28:56,291 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:28:56,291 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:28:56,291 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:28:56,292 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:28:56,292 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:28:56,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:28:56,292 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:28:56,293 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 06:28:56,303 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:28:56,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:28:56,304 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 06:28:56,305 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 06:28:56,305 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 06:28:56,305 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 06:28:56,305 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 06:28:56,305 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 06:28:56,305 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 06:28:56,306 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 06:28:56,306 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 06:28:56,306 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:28:56,306 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:28:56,306 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 06:28:56,306 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:28:56,306 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:28:56,307 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:28:56,307 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 06:28:56,307 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 06:28:56,307 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 06:28:56,307 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:28:56,307 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:28:56,308 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 06:28:56,308 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 06:28:56,308 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 06:28:56,308 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:28:56,308 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:28:56,308 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 06:28:56,309 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:28:56,309 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 06:28:56,309 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 06:28:56,309 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 06:28:56,310 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_fed35c7f-9ea4-42a6-892d-3d6434191a48/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f25230c4e3ada1aa4514132cfb87afb0e539c23b [2018-12-02 06:28:56,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:28:56,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:28:56,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:28:56,342 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:28:56,342 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:28:56,343 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-12-02 06:28:56,376 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/bin-2019/uautomizer/data/7504e216b/0616d7b9f8ad48299e7152b302746781/FLAG4ea362617 [2018-12-02 06:28:56,743 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:28:56,743 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-12-02 06:28:56,749 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/bin-2019/uautomizer/data/7504e216b/0616d7b9f8ad48299e7152b302746781/FLAG4ea362617 [2018-12-02 06:28:57,128 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/bin-2019/uautomizer/data/7504e216b/0616d7b9f8ad48299e7152b302746781 [2018-12-02 06:28:57,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:28:57,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:28:57,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:28:57,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:28:57,135 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:28:57,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:28:57" (1/1) ... [2018-12-02 06:28:57,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586b3ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:28:57, skipping insertion in model container [2018-12-02 06:28:57,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:28:57" (1/1) ... [2018-12-02 06:28:57,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:28:57,165 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:28:57,317 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:28:57,323 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:28:57,383 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:28:57,408 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:28:57,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:28:57 WrapperNode [2018-12-02 06:28:57,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:28:57,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:28:57,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:28:57,409 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:28:57,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:28:57" (1/1) ... [2018-12-02 06:28:57,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:28:57" (1/1) ... [2018-12-02 06:28:57,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:28:57,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:28:57,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:28:57,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:28:57,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:28:57" (1/1) ... [2018-12-02 06:28:57,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:28:57" (1/1) ... [2018-12-02 06:28:57,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:28:57" (1/1) ... [2018-12-02 06:28:57,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:28:57" (1/1) ... [2018-12-02 06:28:57,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:28:57" (1/1) ... [2018-12-02 06:28:57,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:28:57" (1/1) ... [2018-12-02 06:28:57,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:28:57" (1/1) ... [2018-12-02 06:28:57,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:28:57,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:28:57,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:28:57,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:28:57,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:28:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:28:57,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 06:28:57,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 06:28:57,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 06:28:57,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 06:28:57,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:28:57,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:28:57,593 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:28:57,593 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-02 06:28:57,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:28:57 BoogieIcfgContainer [2018-12-02 06:28:57,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:28:57,594 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 06:28:57,594 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 06:28:57,597 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 06:28:57,598 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:28:57,598 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 06:28:57" (1/3) ... [2018-12-02 06:28:57,599 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31c0ce9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:28:57, skipping insertion in model container [2018-12-02 06:28:57,599 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:28:57,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:28:57" (2/3) ... [2018-12-02 06:28:57,599 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31c0ce9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:28:57, skipping insertion in model container [2018-12-02 06:28:57,600 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:28:57,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:28:57" (3/3) ... [2018-12-02 06:28:57,601 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-12-02 06:28:57,635 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 06:28:57,635 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 06:28:57,635 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 06:28:57,636 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 06:28:57,636 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:28:57,636 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:28:57,636 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 06:28:57,636 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:28:57,636 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 06:28:57,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 06:28:57,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-02 06:28:57,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:28:57,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:28:57,660 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 06:28:57,660 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 06:28:57,660 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 06:28:57,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 06:28:57,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-02 06:28:57,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:28:57,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:28:57,662 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 06:28:57,662 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 06:28:57,667 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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; 6#L544true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 11#L544-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; 4#L546true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 7#L547-3true [2018-12-02 06:28:57,667 INFO L796 eck$LassoCheckResult]: Loop: 7#L547-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 19#L549true assume main_~val~0 < 0;main_~val~0 := 0; 3#L549-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 5#L547-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 7#L547-3true [2018-12-02 06:28:57,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:57,672 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-12-02 06:28:57,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:57,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:57,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:57,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:28:57,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:57,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2018-12-02 06:28:57,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:57,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:57,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:28:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:57,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:57,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2018-12-02 06:28:57,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:57,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:57,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:57,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:28:57,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:57,892 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:28:57,892 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:28:57,893 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:28:57,893 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:28:57,893 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 06:28:57,893 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:28:57,893 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:28:57,893 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:28:57,893 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-12-02 06:28:57,894 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:28:57,894 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:28:57,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:57,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:57,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:57,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:57,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:57,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:57,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:57,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:57,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:57,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,116 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 06:28:58,119 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 06:28:58,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:28:58,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:28:58,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:28:58,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:28:58,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:28:58,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:28:58,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:28:58,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:28:58,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:28:58,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:28:58,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:28:58,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:28:58,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:28:58,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:28:58,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:28:58,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:28:58,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:28:58,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:28:58,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:28:58,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:28:58,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:28:58,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:28:58,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:28:58,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:28:58,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,159 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:28:58,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,161 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:28:58,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:28:58,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:28:58,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:28:58,195 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 06:28:58,218 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 06:28:58,218 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 06:28:58,219 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 06:28:58,220 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 06:28:58,221 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 06:28:58,221 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-12-02 06:28:58,227 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 06:28:58,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:28:58,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:28:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:28:58,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:28:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:28:58,288 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-12-02 06:28:58,289 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2018-12-02 06:28:58,322 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-12-02 06:28:58,323 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-12-02 06:28:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 06:28:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-12-02 06:28:58,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-02 06:28:58,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:28:58,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-02 06:28:58,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:28:58,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-02 06:28:58,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:28:58,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2018-12-02 06:28:58,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:28:58,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-12-02 06:28:58,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 06:28:58,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 06:28:58,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-12-02 06:28:58,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:28:58,333 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-02 06:28:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-12-02 06:28:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-02 06:28:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 06:28:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-12-02 06:28:58,349 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-02 06:28:58,349 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-02 06:28:58,349 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 06:28:58,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-12-02 06:28:58,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:28:58,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:28:58,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:28:58,350 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:28:58,350 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 06:28:58,350 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#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; 132#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 133#L544-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; 129#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 130#L547-3 assume !(main_~i~0 < main_~length~0); 134#L547-4 main_~j~0 := 0; 139#L554-3 [2018-12-02 06:28:58,350 INFO L796 eck$LassoCheckResult]: Loop: 139#L554-3 assume !!(main_~j~0 < main_~length~0); 138#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 136#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 137#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 139#L554-3 [2018-12-02 06:28:58,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:58,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2018-12-02 06:28:58,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:58,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:58,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:28:58,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:28:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:28:58,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:28:58,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:28:58,380 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:28:58,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2018-12-02 06:28:58,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:58,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:58,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:28:58,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:58,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:28:58,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:28:58,412 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-12-02 06:28:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:28:58,429 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-02 06:28:58,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:28:58,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-02 06:28:58,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:28:58,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2018-12-02 06:28:58,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 06:28:58,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 06:28:58,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-12-02 06:28:58,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:28:58,431 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-12-02 06:28:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-12-02 06:28:58,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-12-02 06:28:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 06:28:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-02 06:28:58,432 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-02 06:28:58,432 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-02 06:28:58,432 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 06:28:58,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-02 06:28:58,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 06:28:58,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:28:58,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:28:58,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:28:58,433 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 06:28:58,433 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 180#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; 172#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 173#L544-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; 169#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 170#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 174#L549 assume !(main_~val~0 < 0); 167#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 168#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 171#L547-3 assume !(main_~i~0 < main_~length~0); 175#L547-4 main_~j~0 := 0; 179#L554-3 [2018-12-02 06:28:58,433 INFO L796 eck$LassoCheckResult]: Loop: 179#L554-3 assume !!(main_~j~0 < main_~length~0); 178#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 176#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 177#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 179#L554-3 [2018-12-02 06:28:58,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:58,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2018-12-02 06:28:58,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:58,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:58,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:28:58,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:58,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:58,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2018-12-02 06:28:58,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:58,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:58,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:28:58,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:58,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:58,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2018-12-02 06:28:58,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:58,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:58,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:28:58,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:58,599 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:28:58,599 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:28:58,599 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:28:58,599 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:28:58,599 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 06:28:58,600 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:28:58,600 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:28:58,600 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:28:58,600 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-02 06:28:58,600 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:28:58,600 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:28:58,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:58,802 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 06:28:58,802 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 06:28:58,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:28:58,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:28:58,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:28:58,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:28:58,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:28:58,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:28:58,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:28:58,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:28:58,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:28:58,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:28:58,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:28:58,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,811 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:28:58,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,813 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:28:58,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:28:58,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:58,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:58,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:58,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:58,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:58,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:58,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:28:58,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:28:58,838 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 06:28:58,853 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 06:28:58,853 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-02 06:28:58,854 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 06:28:58,855 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 06:28:58,855 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 06:28:58,855 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-12-02 06:28:58,864 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 06:28:58,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:28:58,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:28:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:28:58,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:28:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:28:58,914 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-12-02 06:28:58,914 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-02 06:28:58,924 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-12-02 06:28:58,925 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-12-02 06:28:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 06:28:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-02 06:28:58,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-02 06:28:58,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:28:58,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-02 06:28:58,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:28:58,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 8 letters. [2018-12-02 06:28:58,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:28:58,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-12-02 06:28:58,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 06:28:58,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 25 transitions. [2018-12-02 06:28:58,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 06:28:58,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 06:28:58,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2018-12-02 06:28:58,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:28:58,928 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-12-02 06:28:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2018-12-02 06:28:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-02 06:28:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 06:28:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-12-02 06:28:58,930 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-02 06:28:58,930 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-12-02 06:28:58,930 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 06:28:58,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-12-02 06:28:58,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 06:28:58,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:28:58,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:28:58,931 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:28:58,931 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:28:58,931 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 294#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; 286#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 287#L544-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; 281#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 282#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 284#L549 assume !(main_~val~0 < 0); 279#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 280#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 283#L547-3 assume !(main_~i~0 < main_~length~0); 285#L547-4 main_~j~0 := 0; 293#L554-3 assume !!(main_~j~0 < main_~length~0); 289#L555-3 [2018-12-02 06:28:58,931 INFO L796 eck$LassoCheckResult]: Loop: 289#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 288#L555-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~post9;havoc main_#t~mem8; 289#L555-3 [2018-12-02 06:28:58,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:58,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2018-12-02 06:28:58,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:58,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:58,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:28:58,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:58,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:58,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2018-12-02 06:28:58,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:58,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:58,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:28:58,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:58,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:58,952 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2018-12-02 06:28:58,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:58,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:28:58,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:59,107 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:28:59,107 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:28:59,107 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:28:59,107 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:28:59,107 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 06:28:59,108 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:28:59,108 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:28:59,108 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:28:59,108 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-02 06:28:59,108 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:28:59,108 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:28:59,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:59,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:59,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:59,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:59,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:59,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:59,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:59,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-12-02 06:28:59,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-12-02 06:28:59,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:59,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:28:59,345 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 06:28:59,345 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 06:28:59,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:59,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:59,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:28:59,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:59,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:59,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:59,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:28:59,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:28:59,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:59,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:59,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:59,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:28:59,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:59,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:59,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:59,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:28:59,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:28:59,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:59,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:59,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:59,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:59,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:59,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:59,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:28:59,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:28:59,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:59,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:59,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:59,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:28:59,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:59,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:59,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:59,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:28:59,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:28:59,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:59,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:59,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:59,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:28:59,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:59,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:59,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:59,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:28:59,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:28:59,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:59,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:59,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:59,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:59,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:59,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:59,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:28:59,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:28:59,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:59,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:59,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:59,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:59,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:59,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:59,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:28:59,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:28:59,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:59,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:59,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:59,370 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:28:59,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:59,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:59,371 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:28:59,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:28:59,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:28:59,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:28:59,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:28:59,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:28:59,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:28:59,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:28:59,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:28:59,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:28:59,382 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 06:28:59,386 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 06:28:59,386 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 06:28:59,386 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 06:28:59,387 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 06:28:59,387 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 06:28:59,387 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-12-02 06:28:59,392 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-02 06:28:59,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 06:28:59,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:28:59,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:28:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:28:59,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:28:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:28:59,422 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-12-02 06:28:59,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-02 06:28:59,433 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-12-02 06:28:59,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 06:28:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 06:28:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-02 06:28:59,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-02 06:28:59,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:28:59,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-02 06:28:59,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:28:59,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2018-12-02 06:28:59,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:28:59,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-12-02 06:28:59,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 06:28:59,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2018-12-02 06:28:59,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 06:28:59,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 06:28:59,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2018-12-02 06:28:59,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:28:59,435 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-12-02 06:28:59,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2018-12-02 06:28:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-02 06:28:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 06:28:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-12-02 06:28:59,436 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-02 06:28:59,436 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-02 06:28:59,436 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 06:28:59,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2018-12-02 06:28:59,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 06:28:59,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:28:59,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:28:59,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:28:59,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:28:59,437 INFO L794 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 420#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; 411#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 412#L544-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; 408#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 409#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 413#L549 assume !(main_~val~0 < 0); 406#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 407#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 410#L547-3 assume !(main_~i~0 < main_~length~0); 414#L547-4 main_~j~0 := 0; 419#L554-3 assume !!(main_~j~0 < main_~length~0); 425#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 417#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 418#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 424#L554-3 assume !!(main_~j~0 < main_~length~0); 416#L555-3 [2018-12-02 06:28:59,437 INFO L796 eck$LassoCheckResult]: Loop: 416#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 415#L555-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~post9;havoc main_#t~mem8; 416#L555-3 [2018-12-02 06:28:59,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:59,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2018-12-02 06:28:59,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:59,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:59,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:59,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:28:59,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:28:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:28:59,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:28:59,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fed35c7f-9ea4-42a6-892d-3d6434191a48/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:28:59,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 06:28:59,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 06:28:59,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:28:59,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:28:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:28:59,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:28:59,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-12-02 06:28:59,604 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:28:59,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:59,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2018-12-02 06:28:59,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:59,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:59,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:59,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:28:59,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:59,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 06:28:59,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:28:59,634 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2018-12-02 06:28:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:28:59,794 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-12-02 06:28:59,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:28:59,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2018-12-02 06:28:59,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 06:28:59,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2018-12-02 06:28:59,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 06:28:59,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 06:28:59,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-12-02 06:28:59,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:28:59,796 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-02 06:28:59,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-12-02 06:28:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-12-02 06:28:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 06:28:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-12-02 06:28:59,797 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-02 06:28:59,797 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-12-02 06:28:59,797 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 06:28:59,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2018-12-02 06:28:59,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 06:28:59,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:28:59,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:28:59,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:28:59,798 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:28:59,799 INFO L794 eck$LassoCheckResult]: Stem: 566#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 565#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; 557#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 558#L544-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; 551#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 552#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 555#L549 assume !(main_~val~0 < 0); 573#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 553#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 554#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 556#L549 assume !(main_~val~0 < 0); 549#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 550#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 571#L547-3 assume !(main_~i~0 < main_~length~0); 563#L547-4 main_~j~0 := 0; 564#L554-3 assume !!(main_~j~0 < main_~length~0); 562#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 572#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 569#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 570#L554-3 assume !!(main_~j~0 < main_~length~0); 560#L555-3 [2018-12-02 06:28:59,799 INFO L796 eck$LassoCheckResult]: Loop: 560#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 559#L555-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~post9;havoc main_#t~mem8; 560#L555-3 [2018-12-02 06:28:59,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:59,799 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2018-12-02 06:28:59,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:59,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:59,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:59,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:28:59,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:59,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:59,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2018-12-02 06:28:59,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:59,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:59,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:59,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:28:59,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:59,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:28:59,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2018-12-02 06:28:59,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:28:59,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:28:59,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:59,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:28:59,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:28:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:28:59,977 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2018-12-02 06:29:00,017 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:29:00,018 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:29:00,018 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:29:00,018 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:29:00,018 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 06:29:00,018 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:29:00,018 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:29:00,018 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:29:00,018 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-02 06:29:00,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:29:00,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:29:00,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:00,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:00,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:00,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:00,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:00,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:00,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:00,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:00,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:00,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:00,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:00,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:00,179 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 06:29:00,179 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 06:29:00,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:29:00,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:00,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:00,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:00,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:00,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:00,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:00,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:00,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:00,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:29:00,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:00,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:00,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:00,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:00,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:00,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:00,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:00,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:29:00,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:00,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:00,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:00,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:00,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:00,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:00,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:00,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:29:00,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:00,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:00,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:00,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:00,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:00,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:00,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:00,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:29:00,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:00,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:00,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:00,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:00,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:00,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:00,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:00,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:29:00,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:00,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:00,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:00,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:00,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:00,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:00,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:00,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:29:00,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:00,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:00,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:00,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:00,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:00,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:00,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:00,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:29:00,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:00,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:00,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:00,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:00,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:00,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:00,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:00,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:29:00,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:00,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:00,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:00,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:00,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:00,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:00,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:00,203 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 06:29:00,204 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 06:29:00,204 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 06:29:00,205 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 06:29:00,205 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 06:29:00,205 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 06:29:00,205 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))_3) = 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))_3 Supporting invariants [] [2018-12-02 06:29:00,211 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-02 06:29:00,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 06:29:00,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:00,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:00,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:00,241 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-12-02 06:29:00,242 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 06:29:00,250 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-12-02 06:29:00,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 06:29:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 06:29:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-02 06:29:00,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-12-02 06:29:00,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:00,251 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 06:29:00,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:00,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:00,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:00,279 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-12-02 06:29:00,280 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 06:29:00,288 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-12-02 06:29:00,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 06:29:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 06:29:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-02 06:29:00,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-12-02 06:29:00,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:00,289 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 06:29:00,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:00,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:00,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:00,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:00,313 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-12-02 06:29:00,313 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 06:29:00,321 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-12-02 06:29:00,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 06:29:00,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 06:29:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-12-02 06:29:00,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2018-12-02 06:29:00,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:00,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2018-12-02 06:29:00,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:00,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2018-12-02 06:29:00,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:00,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2018-12-02 06:29:00,323 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 06:29:00,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-12-02 06:29:00,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 06:29:00,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 06:29:00,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 06:29:00,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:29:00,323 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:29:00,323 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:29:00,323 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:29:00,323 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 06:29:00,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 06:29:00,323 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 06:29:00,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 06:29:00,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 06:29:00 BoogieIcfgContainer [2018-12-02 06:29:00,327 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 06:29:00,327 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:29:00,327 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:29:00,327 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:29:00,328 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:28:57" (3/4) ... [2018-12-02 06:29:00,330 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 06:29:00,330 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:29:00,330 INFO L168 Benchmark]: Toolchain (without parser) took 3199.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -72.6 MB). Peak memory consumption was 94.6 MB. Max. memory is 11.5 GB. [2018-12-02 06:29:00,331 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:29:00,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -137.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-02 06:29:00,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 06:29:00,332 INFO L168 Benchmark]: Boogie Preprocessor took 13.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:29:00,332 INFO L168 Benchmark]: RCFGBuilder took 148.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-02 06:29:00,332 INFO L168 Benchmark]: BuchiAutomizer took 2732.81 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. [2018-12-02 06:29:00,332 INFO L168 Benchmark]: Witness Printer took 2.55 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-12-02 06:29:00,334 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -137.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 148.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2732.81 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.55 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][4 * j + arr] 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 2.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.1s. 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 ax100 hnf98 lsp93 ukn80 mio100 lsp57 div100 bol100 ite100 ukn100 eq161 hnf90 smp93 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms 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...