./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d74fabb5-48e6-453f-811a-f8454af300d9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d74fabb5-48e6-453f-811a-f8454af300d9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d74fabb5-48e6-453f-811a-f8454af300d9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d74fabb5-48e6-453f-811a-f8454af300d9/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_d74fabb5-48e6-453f-811a-f8454af300d9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d74fabb5-48e6-453f-811a-f8454af300d9/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-0cd3be1 [2018-11-28 10:33:30,389 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:33:30,391 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:33:30,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:33:30,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:33:30,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:33:30,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:33:30,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:33:30,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:33:30,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:33:30,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:33:30,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:33:30,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:33:30,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:33:30,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:33:30,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:33:30,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:33:30,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:33:30,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:33:30,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:33:30,410 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:33:30,410 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:33:30,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:33:30,412 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:33:30,412 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:33:30,413 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:33:30,414 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:33:30,414 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:33:30,414 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:33:30,415 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:33:30,415 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:33:30,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:33:30,415 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:33:30,415 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:33:30,416 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:33:30,416 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:33:30,416 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d74fabb5-48e6-453f-811a-f8454af300d9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 10:33:30,427 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:33:30,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:33:30,428 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:33:30,428 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:33:30,428 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:33:30,428 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 10:33:30,429 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 10:33:30,429 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 10:33:30,429 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 10:33:30,429 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 10:33:30,429 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 10:33:30,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:33:30,429 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:33:30,430 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:33:30,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:33:30,430 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:33:30,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:33:30,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 10:33:30,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 10:33:30,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 10:33:30,431 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:33:30,431 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:33:30,431 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 10:33:30,431 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:33:30,431 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 10:33:30,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:33:30,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:33:30,432 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 10:33:30,432 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:33:30,432 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:33:30,432 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 10:33:30,433 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 10:33:30,433 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_d74fabb5-48e6-453f-811a-f8454af300d9/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-11-28 10:33:30,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:33:30,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:33:30,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:33:30,468 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:33:30,468 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:33:30,469 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d74fabb5-48e6-453f-811a-f8454af300d9/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-11-28 10:33:30,508 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d74fabb5-48e6-453f-811a-f8454af300d9/bin-2019/uautomizer/data/c96074112/cdf5f730a1104c5b9e0edb1f8bde2b38/FLAG3779f0ab4 [2018-11-28 10:33:30,946 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:33:30,946 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d74fabb5-48e6-453f-811a-f8454af300d9/sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-11-28 10:33:30,953 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d74fabb5-48e6-453f-811a-f8454af300d9/bin-2019/uautomizer/data/c96074112/cdf5f730a1104c5b9e0edb1f8bde2b38/FLAG3779f0ab4 [2018-11-28 10:33:30,965 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d74fabb5-48e6-453f-811a-f8454af300d9/bin-2019/uautomizer/data/c96074112/cdf5f730a1104c5b9e0edb1f8bde2b38 [2018-11-28 10:33:30,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:33:30,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:33:30,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:30,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:33:30,973 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:33:30,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:30" (1/1) ... [2018-11-28 10:33:30,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39239a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:30, skipping insertion in model container [2018-11-28 10:33:30,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:30" (1/1) ... [2018-11-28 10:33:30,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:33:31,007 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:33:31,193 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:31,246 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:33:31,273 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:31,304 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:33:31,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31 WrapperNode [2018-11-28 10:33:31,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:31,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:31,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:33:31,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:33:31,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:31,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:33:31,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:33:31,335 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:33:31,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:33:31,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:33:31,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:33:31,352 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:33:31,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d74fabb5-48e6-453f-811a-f8454af300d9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:31,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:33:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 10:33:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 10:33:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 10:33:31,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:33:31,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:33:31,546 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:33:31,546 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 10:33:31,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:31 BoogieIcfgContainer [2018-11-28 10:33:31,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:33:31,547 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 10:33:31,547 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 10:33:31,550 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 10:33:31,551 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:33:31,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 10:33:30" (1/3) ... [2018-11-28 10:33:31,552 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fbb7330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:33:31, skipping insertion in model container [2018-11-28 10:33:31,552 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:33:31,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (2/3) ... [2018-11-28 10:33:31,552 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fbb7330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:33:31, skipping insertion in model container [2018-11-28 10:33:31,552 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:33:31,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:31" (3/3) ... [2018-11-28 10:33:31,554 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-11-28 10:33:31,589 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:33:31,590 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 10:33:31,590 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 10:33:31,590 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 10:33:31,590 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:33:31,590 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:33:31,590 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 10:33:31,591 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:33:31,591 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 10:33:31,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 10:33:31,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 10:33:31,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:31,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:31,622 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:33:31,623 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 10:33:31,623 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 10:33:31,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 10:33:31,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 10:33:31,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:31,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:31,625 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:33:31,625 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 10:33:31,631 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-11-28 10:33:31,631 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-11-28 10:33:31,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:31,635 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-28 10:33:31,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:31,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:31,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:31,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:31,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:31,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:31,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2018-11-28 10:33:31,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:31,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:31,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:31,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:31,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:31,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:31,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2018-11-28 10:33:31,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:31,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:31,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:31,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:31,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:31,912 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:31,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:31,913 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:31,913 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:31,913 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:33:31,913 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:31,913 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:31,913 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:31,913 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-28 10:33:31,913 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:31,914 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:31,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:31,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:31,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:31,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:31,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:31,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:31,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:31,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:31,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:32,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-11-28 10:33:32,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:32,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-11-28 10:33:32,181 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:32,185 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:33:32,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:32,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:32,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:32,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:32,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:32,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:32,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:32,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:32,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:32,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:32,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:32,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:32,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:32,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:32,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:32,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:32,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:32,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:32,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:32,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:32,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:32,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:32,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:32,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:32,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:32,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:32,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:32,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:32,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:32,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:32,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:32,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:32,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:32,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:32,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:32,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:32,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:32,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:32,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:32,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:32,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:32,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:32,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:32,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:32,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:32,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:32,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:32,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:32,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:32,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:32,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:32,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:32,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:32,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:32,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:32,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:32,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:32,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:32,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:32,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:32,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:32,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:32,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:32,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:32,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:32,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:32,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:32,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:32,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:32,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:32,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:32,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:32,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:32,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:32,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:32,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:32,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:32,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:32,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:32,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:32,241 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:33:32,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:32,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:32,244 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:33:32,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:32,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:32,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:32,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:32,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:32,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:32,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:32,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:32,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:32,292 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:33:32,321 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 10:33:32,321 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 10:33:32,323 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:33:32,324 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:33:32,324 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:33:32,324 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-28 10:33:32,351 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 10:33:32,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:32,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:32,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:32,410 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:33:32,410 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2018-11-28 10:33:32,444 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2018-11-28 10:33:32,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:33:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:33:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-28 10:33:32,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 10:33:32,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:32,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 10:33:32,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:32,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-28 10:33:32,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:32,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2018-11-28 10:33:32,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 10:33:32,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-11-28 10:33:32,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 10:33:32,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 10:33:32,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-28 10:33:32,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:33:32,456 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 10:33:32,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-28 10:33:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 10:33:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 10:33:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-28 10:33:32,473 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 10:33:32,474 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 10:33:32,474 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 10:33:32,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-28 10:33:32,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 10:33:32,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:32,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:32,475 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:32,475 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 10:33:32,475 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-11-28 10:33:32,475 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-11-28 10:33:32,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2018-11-28 10:33:32,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:32,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:32,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:32,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:33:32,513 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:33:32,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2018-11-28 10:33:32,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:32,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:33:32,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:33:32,567 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-28 10:33:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:32,594 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-28 10:33:32,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 10:33:32,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-28 10:33:32,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 10:33:32,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2018-11-28 10:33:32,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 10:33:32,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 10:33:32,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-11-28 10:33:32,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:33:32,597 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-28 10:33:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-11-28 10:33:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-28 10:33:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 10:33:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 10:33:32,599 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 10:33:32,599 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 10:33:32,599 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 10:33:32,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-28 10:33:32,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 10:33:32,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:32,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:32,600 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:32,600 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 10:33:32,600 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-11-28 10:33:32,600 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-11-28 10:33:32,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2018-11-28 10:33:32,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:32,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,614 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2018-11-28 10:33:32,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:32,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2018-11-28 10:33:32,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,823 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-11-28 10:33:32,854 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:32,854 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:32,854 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:32,854 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:32,854 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:33:32,854 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:32,854 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:32,854 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:32,854 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-28 10:33:32,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:32,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:32,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:32,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:32,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:32,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:32,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:32,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:32,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:32,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:32,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:32,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:32,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,096 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:33,096 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:33:33,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,107 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:33:33,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,111 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:33:33,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,132 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:33:33,145 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 10:33:33,145 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 10:33:33,146 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:33:33,147 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:33:33,147 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:33:33,147 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-28 10:33:33,183 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 10:33:33,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:33,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:33,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:33,223 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:33:33,223 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 10:33:33,236 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 4 states. [2018-11-28 10:33:33,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 10:33:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:33:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-28 10:33:33,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-28 10:33:33,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:33,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-28 10:33:33,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:33,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-28 10:33:33,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:33,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-11-28 10:33:33,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:33:33,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 25 transitions. [2018-11-28 10:33:33,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 10:33:33,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 10:33:33,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2018-11-28 10:33:33,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:33:33,240 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-28 10:33:33,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2018-11-28 10:33:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-28 10:33:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 10:33:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-11-28 10:33:33,241 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-28 10:33:33,241 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-28 10:33:33,241 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 10:33:33,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-11-28 10:33:33,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:33:33,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:33,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:33,247 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:33,247 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 10:33:33,247 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-11-28 10:33:33,247 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~mem8;havoc main_#t~post9; 289#L555-3 [2018-11-28 10:33:33,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:33,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2018-11-28 10:33:33,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:33,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:33,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:33,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:33,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:33,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:33,261 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2018-11-28 10:33:33,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:33,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:33,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:33,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:33,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:33,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:33,267 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2018-11-28 10:33:33,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:33,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:33,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:33,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:33,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:33,414 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2018-11-28 10:33:33,442 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:33,443 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:33,443 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:33,443 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:33,443 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:33:33,443 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:33,443 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:33,443 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:33,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-28 10:33:33,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:33,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:33,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,680 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:33,680 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:33:33,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,707 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:33:33,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,708 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:33:33,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,719 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:33:33,722 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 10:33:33,722 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 10:33:33,722 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:33:33,723 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:33:33,723 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:33:33,723 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2018-11-28 10:33:33,754 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 10:33:33,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 10:33:33,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:33,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:33,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:33,802 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:33:33,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 10:33:33,813 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 27 states and 35 transitions. Complement of second has 7 states. [2018-11-28 10:33:33,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:33:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:33:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 10:33:33,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 10:33:33,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:33,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-28 10:33:33,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:33,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-28 10:33:33,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:33,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-11-28 10:33:33,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:33:33,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2018-11-28 10:33:33,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 10:33:33,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 10:33:33,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2018-11-28 10:33:33,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:33:33,816 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-28 10:33:33,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2018-11-28 10:33:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 10:33:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 10:33:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-11-28 10:33:33,818 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-28 10:33:33,818 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-28 10:33:33,818 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 10:33:33,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2018-11-28 10:33:33,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:33:33,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:33,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:33,819 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:33,819 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 10:33:33,819 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-11-28 10:33:33,819 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~mem8;havoc main_#t~post9; 416#L555-3 [2018-11-28 10:33:33,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:33,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2018-11-28 10:33:33,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:33,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:33,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:33,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:33,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:33,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:33:33,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d74fabb5-48e6-453f-811a-f8454af300d9/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:33:33,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 10:33:33,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 10:33:33,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:33:33,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:33,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:33:33,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-11-28 10:33:33,966 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:33:33,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:33,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2018-11-28 10:33:33,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:33,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:33,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:33,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:33,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:34,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 10:33:34,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-28 10:33:34,010 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2018-11-28 10:33:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:34,150 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-11-28 10:33:34,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 10:33:34,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2018-11-28 10:33:34,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:33:34,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2018-11-28 10:33:34,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 10:33:34,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 10:33:34,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-11-28 10:33:34,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:33:34,152 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-28 10:33:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-11-28 10:33:34,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-28 10:33:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 10:33:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-11-28 10:33:34,154 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-28 10:33:34,154 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-28 10:33:34,154 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 10:33:34,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2018-11-28 10:33:34,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:33:34,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:34,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:34,155 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:34,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 10:33:34,156 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-11-28 10:33:34,156 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~mem8;havoc main_#t~post9; 560#L555-3 [2018-11-28 10:33:34,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:34,156 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2018-11-28 10:33:34,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:34,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:34,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:34,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:34,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:34,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2018-11-28 10:33:34,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:34,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:34,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:34,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:34,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:34,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2018-11-28 10:33:34,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:34,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:34,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:34,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:34,382 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2018-11-28 10:33:34,432 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:34,432 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:34,432 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:34,432 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:34,432 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:33:34,432 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:34,432 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:34,432 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:34,432 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-28 10:33:34,433 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:34,433 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:34,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,657 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:34,658 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:33:34,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:34,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:34,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:34,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:34,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:34,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:34,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:34,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:34,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:34,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:34,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:34,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:34,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:34,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:34,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:34,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:34,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:34,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:34,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:34,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:34,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:34,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:34,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:34,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:34,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:34,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:34,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:34,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:34,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:34,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:34,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:34,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:34,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:34,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:34,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:34,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:34,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:34,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:34,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:34,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:34,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:34,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:34,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:34,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:34,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:34,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:34,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:34,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:34,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:34,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:34,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:34,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:34,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:34,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:34,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:34,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:34,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:34,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:34,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:34,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:34,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:34,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:34,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:34,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:34,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:34,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:34,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:34,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:34,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:34,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:34,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:34,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:34,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:34,686 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:33:34,686 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 10:33:34,686 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 10:33:34,687 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:33:34,687 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 10:33:34,687 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:33:34,687 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-11-28 10:33:34,699 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 10:33:34,700 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 10:33:34,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:34,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:34,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:34,738 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:33:34,739 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-28 10:33:34,753 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-11-28 10:33:34,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:33:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:33:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 10:33:34,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-11-28 10:33:34,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:34,755 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 10:33:34,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:34,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:34,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:34,799 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:33:34,799 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-28 10:33:34,825 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-11-28 10:33:34,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:33:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:33:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 10:33:34,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-11-28 10:33:34,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:34,828 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 10:33:34,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:34,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:34,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:34,870 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:33:34,870 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-28 10:33:34,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2018-11-28 10:33:34,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:33:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:33:34,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-28 10:33:34,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2018-11-28 10:33:34,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:34,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2018-11-28 10:33:34,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:34,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-28 10:33:34,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:34,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2018-11-28 10:33:34,886 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:33:34,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-11-28 10:33:34,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 10:33:34,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 10:33:34,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 10:33:34,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:33:34,886 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:34,886 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:34,886 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:34,886 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 10:33:34,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 10:33:34,886 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:33:34,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 10:33:34,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 10:33:34 BoogieIcfgContainer [2018-11-28 10:33:34,892 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 10:33:34,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:33:34,893 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:33:34,893 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:33:34,893 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:31" (3/4) ... [2018-11-28 10:33:34,896 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 10:33:34,896 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:33:34,896 INFO L168 Benchmark]: Toolchain (without parser) took 3928.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -85.0 MB). Peak memory consumption was 99.6 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:34,897 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:34,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:34,897 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:34,897 INFO L168 Benchmark]: Boogie Preprocessor took 16.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:34,898 INFO L168 Benchmark]: RCFGBuilder took 195.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:34,898 INFO L168 Benchmark]: BuchiAutomizer took 3345.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 113.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:34,899 INFO L168 Benchmark]: Witness Printer took 3.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:34,901 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 195.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3345.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 113.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.29 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 3.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. 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: 13ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...