./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1cb3d38d-d5de-494d-ae40-0486cacf4049/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1cb3d38d-d5de-494d-ae40-0486cacf4049/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1cb3d38d-d5de-494d-ae40-0486cacf4049/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1cb3d38d-d5de-494d-ae40-0486cacf4049/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_1cb3d38d-d5de-494d-ae40-0486cacf4049/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1cb3d38d-d5de-494d-ae40-0486cacf4049/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-aa41828 [2018-11-23 13:11:55,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:11:55,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:11:55,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:11:55,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:11:55,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:11:55,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:11:55,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:11:55,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:11:55,906 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:11:55,906 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:11:55,906 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:11:55,907 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:11:55,908 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:11:55,908 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:11:55,909 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:11:55,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:11:55,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:11:55,912 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:11:55,913 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:11:55,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:11:55,914 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:11:55,915 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:11:55,916 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:11:55,916 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:11:55,916 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:11:55,917 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:11:55,918 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:11:55,918 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:11:55,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:11:55,919 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:11:55,920 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:11:55,920 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:11:55,920 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:11:55,921 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:11:55,921 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:11:55,921 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1cb3d38d-d5de-494d-ae40-0486cacf4049/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 13:11:55,929 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:11:55,930 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:11:55,930 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:11:55,930 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:11:55,931 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:11:55,931 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:11:55,931 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:11:55,931 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:11:55,931 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:11:55,931 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:11:55,931 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:11:55,931 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:11:55,932 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:11:55,932 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:11:55,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:11:55,932 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:11:55,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:11:55,932 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:11:55,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:11:55,932 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:11:55,932 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:11:55,933 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:11:55,933 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:11:55,933 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:11:55,933 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:11:55,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:11:55,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:11:55,933 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:11:55,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:11:55,933 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:11:55,934 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:11:55,934 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:11:55,934 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_1cb3d38d-d5de-494d-ae40-0486cacf4049/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-23 13:11:55,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:11:55,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:11:55,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:11:55,965 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:11:55,965 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:11:55,966 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1cb3d38d-d5de-494d-ae40-0486cacf4049/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-11-23 13:11:56,008 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1cb3d38d-d5de-494d-ae40-0486cacf4049/bin-2019/uautomizer/data/e0a86d5cf/9ccf030fe4754701b8e62d51251c807e/FLAGc08373632 [2018-11-23 13:11:56,457 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:11:56,458 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1cb3d38d-d5de-494d-ae40-0486cacf4049/sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-11-23 13:11:56,465 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1cb3d38d-d5de-494d-ae40-0486cacf4049/bin-2019/uautomizer/data/e0a86d5cf/9ccf030fe4754701b8e62d51251c807e/FLAGc08373632 [2018-11-23 13:11:56,475 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1cb3d38d-d5de-494d-ae40-0486cacf4049/bin-2019/uautomizer/data/e0a86d5cf/9ccf030fe4754701b8e62d51251c807e [2018-11-23 13:11:56,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:11:56,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:11:56,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:11:56,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:11:56,483 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:11:56,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:11:56" (1/1) ... [2018-11-23 13:11:56,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19418497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:56, skipping insertion in model container [2018-11-23 13:11:56,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:11:56" (1/1) ... [2018-11-23 13:11:56,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:11:56,525 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:11:56,713 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:11:56,721 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:11:56,792 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:11:56,814 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:11:56,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:56 WrapperNode [2018-11-23 13:11:56,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:11:56,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:11:56,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:11:56,815 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:11:56,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:56" (1/1) ... [2018-11-23 13:11:56,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:56" (1/1) ... [2018-11-23 13:11:56,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:11:56,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:11:56,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:11:56,844 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:11:56,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:56" (1/1) ... [2018-11-23 13:11:56,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:56" (1/1) ... [2018-11-23 13:11:56,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:56" (1/1) ... [2018-11-23 13:11:56,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:56" (1/1) ... [2018-11-23 13:11:56,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:56" (1/1) ... [2018-11-23 13:11:56,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:56" (1/1) ... [2018-11-23 13:11:56,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:56" (1/1) ... [2018-11-23 13:11:56,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:11:56,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:11:56,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:11:56,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:11:56,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1cb3d38d-d5de-494d-ae40-0486cacf4049/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:11:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:11:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:11:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:11:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:11:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:11:56,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:11:57,044 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:11:57,044 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 13:11:57,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:57 BoogieIcfgContainer [2018-11-23 13:11:57,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:11:57,045 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:11:57,045 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:11:57,047 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:11:57,048 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:11:57,048 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:11:56" (1/3) ... [2018-11-23 13:11:57,049 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a819813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:11:57, skipping insertion in model container [2018-11-23 13:11:57,049 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:11:57,049 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:56" (2/3) ... [2018-11-23 13:11:57,050 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a819813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:11:57, skipping insertion in model container [2018-11-23 13:11:57,050 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:11:57,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:57" (3/3) ... [2018-11-23 13:11:57,051 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-11-23 13:11:57,090 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:11:57,090 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:11:57,090 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:11:57,091 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:11:57,091 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:11:57,091 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:11:57,091 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:11:57,091 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:11:57,091 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:11:57,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 13:11:57,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 13:11:57,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:11:57,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:11:57,123 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 13:11:57,123 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:11:57,123 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:11:57,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 13:11:57,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 13:11:57,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:11:57,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:11:57,125 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 13:11:57,125 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:11:57,132 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-23 13:11:57,132 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-23 13:11:57,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:57,137 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-23 13:11:57,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:57,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:57,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:57,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:57,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:57,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2018-11-23 13:11:57,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:57,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:57,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:57,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:57,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:57,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:57,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2018-11-23 13:11:57,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:57,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:57,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:57,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:57,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:57,432 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:11:57,432 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:11:57,433 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:11:57,433 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:11:57,433 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:11:57,433 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:11:57,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:11:57,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:11:57,433 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-23 13:11:57,433 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:11:57,434 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:11:57,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:57,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-23 13:11:57,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-23 13:11:57,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:57,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-23 13:11:57,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:57,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:57,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:57,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:57,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:57,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:57,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:57,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:11:57,758 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:11:57,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:57,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:57,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:57,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:57,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:57,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:57,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:57,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:57,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:57,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:57,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:57,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:57,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:57,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:57,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:57,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:57,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:57,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:57,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:57,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:57,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:57,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:57,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:57,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:57,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:57,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:57,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:57,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:57,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:57,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:57,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:57,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:57,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:57,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:57,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:57,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:57,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:57,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:57,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:57,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:57,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:57,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:11:57,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:11:57,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:57,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:57,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:57,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:57,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:57,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:57,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:57,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:57,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:57,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:57,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:57,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:57,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:57,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:57,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:57,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:57,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:57,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:57,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:57,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:57,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:57,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:57,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:57,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:57,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:11:57,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:11:57,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:57,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:57,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:57,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:57,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:57,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:57,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:11:57,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:11:57,860 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:11:57,878 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:11:57,878 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:11:57,880 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:11:57,881 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:11:57,882 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:11:57,882 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset Supporting invariants [] [2018-11-23 13:11:57,905 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 13:11:57,909 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:11:57,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:57,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:57,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:57,984 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:11:57,985 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-23 13:11:58,030 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2018-11-23 13:11:58,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:11:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:11:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-23 13:11:58,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 13:11:58,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:11:58,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 13:11:58,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:11:58,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 13:11:58,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:11:58,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2018-11-23 13:11:58,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:11:58,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-11-23 13:11:58,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 13:11:58,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 13:11:58,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-23 13:11:58,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:11:58,045 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 13:11:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-23 13:11:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:11:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:11:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-23 13:11:58,064 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 13:11:58,064 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 13:11:58,064 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:11:58,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-23 13:11:58,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:11:58,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:11:58,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:11:58,065 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:58,065 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:11:58,065 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-23 13:11:58,065 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-23 13:11:58,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2018-11-23 13:11:58,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:58,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:58,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:58,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:58,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:58,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:11:58,096 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:11:58,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:58,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2018-11-23 13:11:58,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:58,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:58,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:58,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:11:58,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:11:58,139 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-23 13:11:58,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:58,160 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 13:11:58,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:11:58,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 13:11:58,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:11:58,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2018-11-23 13:11:58,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 13:11:58,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 13:11:58,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-11-23 13:11:58,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:11:58,162 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-23 13:11:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-11-23 13:11:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-23 13:11:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:11:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-23 13:11:58,164 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 13:11:58,164 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 13:11:58,164 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:11:58,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-23 13:11:58,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:11:58,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:11:58,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:11:58,167 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:58,167 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:11:58,167 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-23 13:11:58,168 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-23 13:11:58,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:58,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2018-11-23 13:11:58,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:58,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:58,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:58,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:58,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2018-11-23 13:11:58,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:58,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:58,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:58,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:58,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2018-11-23 13:11:58,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:58,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:58,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:58,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,349 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2018-11-23 13:11:58,375 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:11:58,375 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:11:58,375 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:11:58,375 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:11:58,375 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:11:58,375 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:11:58,375 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:11:58,375 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:11:58,375 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-23 13:11:58,375 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:11:58,376 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:11:58,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,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-23 13:11:58,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,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-23 13:11:58,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,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-23 13:11:58,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,600 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:11:58,600 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:11:58,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:58,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:58,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:58,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:58,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:58,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:58,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:58,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:58,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:58,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:58,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:58,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:58,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:58,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:58,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:58,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:58,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:58,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:58,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:58,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:58,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:58,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:58,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:58,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:58,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:58,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:58,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:58,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:58,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:58,613 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:11:58,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:58,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:58,615 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:11:58,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:11:58,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:58,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:58,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:58,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:58,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:58,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:58,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:11:58,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:11:58,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:58,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:58,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:58,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:58,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:58,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:58,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:11:58,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:11:58,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:58,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:58,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:58,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:58,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:58,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:58,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:11:58,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:11:58,661 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:11:58,676 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 13:11:58,676 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 13:11:58,677 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:11:58,678 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:11:58,678 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:11:58,678 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-23 13:11:58,688 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 13:11:58,689 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:11:58,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:58,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:58,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:58,739 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:11:58,739 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-23 13:11:58,759 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2018-11-23 13:11:58,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:11:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:11:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-23 13:11:58,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-23 13:11:58,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:11:58,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-23 13:11:58,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:11:58,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-23 13:11:58,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:11:58,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2018-11-23 13:11:58,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:11:58,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2018-11-23 13:11:58,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 13:11:58,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 13:11:58,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2018-11-23 13:11:58,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:11:58,762 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-23 13:11:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2018-11-23 13:11:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-11-23 13:11:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:11:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-11-23 13:11:58,764 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-23 13:11:58,764 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-23 13:11:58,764 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:11:58,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-11-23 13:11:58,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:11:58,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:11:58,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:11:58,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:58,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:11:58,768 INFO L794 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 298#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; 290#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 291#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; 285#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 286#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 288#L549 assume !(main_~val~0 < 0); 283#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 284#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 287#L547-3 assume !(main_~i~0 < main_~length~0); 289#L547-4 main_~j~0 := 0; 297#L554-3 assume !!(main_~j~0 < main_~length~0); 293#L555-3 [2018-11-23 13:11:58,768 INFO L796 eck$LassoCheckResult]: Loop: 293#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 292#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; 293#L555-3 [2018-11-23 13:11:58,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2018-11-23 13:11:58,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:58,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:58,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:58,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:58,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2018-11-23 13:11:58,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:58,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:58,788 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2018-11-23 13:11:58,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:58,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:58,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:58,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:58,937 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2018-11-23 13:11:58,963 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:11:58,963 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:11:58,963 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:11:58,963 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:11:58,963 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:11:58,963 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:11:58,964 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:11:58,964 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:11:58,964 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-23 13:11:58,964 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:11:58,964 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:11:58,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:58,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:59,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:59,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:59,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:59,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:59,219 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:11:59,219 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:11:59,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:59,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:59,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:59,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:59,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:59,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:59,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:59,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:59,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:59,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:59,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:59,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:59,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:59,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:59,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:59,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:59,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:59,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:59,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:59,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:59,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:59,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:59,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:59,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:11:59,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:11:59,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:59,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:59,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:59,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:59,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:59,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:59,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:59,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:59,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:59,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:59,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:59,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:59,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:59,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:59,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:59,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:59,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:59,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:59,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:59,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:59,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:59,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:11:59,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:59,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:59,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:59,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:11:59,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:11:59,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:59,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:59,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:59,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:59,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:59,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:59,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:11:59,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:11:59,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:59,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:59,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:59,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:59,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:59,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:59,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:11:59,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:11:59,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:59,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:59,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:59,246 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:11:59,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:59,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:59,247 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:11:59,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:11:59,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:11:59,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:11:59,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:11:59,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:11:59,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:11:59,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:11:59,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:11:59,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:11:59,258 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:11:59,262 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:11:59,262 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 13:11:59,262 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:11:59,263 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:11:59,264 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:11:59,264 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2 Supporting invariants [] [2018-11-23 13:11:59,288 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 13:11:59,293 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:11:59,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:59,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:59,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:59,331 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 13:11:59,332 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 13:11:59,359 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 27 states and 35 transitions. Complement of second has 8 states. [2018-11-23 13:11:59,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:11:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:11:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-23 13:11:59,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-23 13:11:59,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:11:59,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-23 13:11:59,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:11:59,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-23 13:11:59,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:11:59,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-11-23 13:11:59,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:11:59,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2018-11-23 13:11:59,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 13:11:59,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 13:11:59,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2018-11-23 13:11:59,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:11:59,363 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-23 13:11:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2018-11-23 13:11:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 13:11:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:11:59,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-11-23 13:11:59,364 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-23 13:11:59,365 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-23 13:11:59,365 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:11:59,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2018-11-23 13:11:59,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:11:59,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:11:59,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:11:59,366 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:59,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:11:59,366 INFO L794 eck$LassoCheckResult]: Stem: 432#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 431#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; 424#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 425#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; 419#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 420#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 422#L549 assume !(main_~val~0 < 0); 417#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 418#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 421#L547-3 assume !(main_~i~0 < main_~length~0); 423#L547-4 main_~j~0 := 0; 430#L554-3 assume !!(main_~j~0 < main_~length~0); 429#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 437#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 433#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 434#L554-3 assume !!(main_~j~0 < main_~length~0); 427#L555-3 [2018-11-23 13:11:59,366 INFO L796 eck$LassoCheckResult]: Loop: 427#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 426#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; 427#L555-3 [2018-11-23 13:11:59,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2018-11-23 13:11:59,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:59,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:59,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:59,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1cb3d38d-d5de-494d-ae40-0486cacf4049/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:59,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:11:59,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:11:59,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:59,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:59,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:59,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-11-23 13:11:59,544 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:11:59,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:59,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2018-11-23 13:11:59,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:59,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:59,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:59,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:59,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:59,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:11:59,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:11:59,565 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2018-11-23 13:11:59,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:59,715 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-11-23 13:11:59,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:11:59,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2018-11-23 13:11:59,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:11:59,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2018-11-23 13:11:59,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 13:11:59,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 13:11:59,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-11-23 13:11:59,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:11:59,717 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-23 13:11:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-11-23 13:11:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-23 13:11:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:11:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-11-23 13:11:59,718 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-23 13:11:59,718 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-23 13:11:59,719 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 13:11:59,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2018-11-23 13:11:59,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 13:11:59,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:11:59,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:11:59,720 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:59,720 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:11:59,720 INFO L794 eck$LassoCheckResult]: Stem: 577#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 576#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; 568#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 569#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; 562#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 563#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 566#L549 assume !(main_~val~0 < 0); 584#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 564#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 565#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 567#L549 assume !(main_~val~0 < 0); 560#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 561#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 582#L547-3 assume !(main_~i~0 < main_~length~0); 574#L547-4 main_~j~0 := 0; 575#L554-3 assume !!(main_~j~0 < main_~length~0); 573#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 583#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 580#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 581#L554-3 assume !!(main_~j~0 < main_~length~0); 571#L555-3 [2018-11-23 13:11:59,720 INFO L796 eck$LassoCheckResult]: Loop: 571#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 570#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; 571#L555-3 [2018-11-23 13:11:59,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:59,720 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2018-11-23 13:11:59,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:59,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:59,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:59,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:59,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:59,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2018-11-23 13:11:59,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:59,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:59,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:59,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:59,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:59,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2018-11-23 13:11:59,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:59,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:59,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:59,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:59,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:11:59,924 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2018-11-23 13:11:59,958 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:11:59,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:11:59,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:11:59,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:11:59,958 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:11:59,958 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:11:59,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:11:59,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:11:59,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-23 13:11:59,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:11:59,959 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:11:59,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:59,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:59,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:11:59,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:00,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:00,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:00,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:00,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:00,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:00,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:00,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:00,148 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:00,149 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:00,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:00,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:00,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:00,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:00,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:00,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:00,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:00,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:00,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:00,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:00,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:00,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:00,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:00,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:00,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:00,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:00,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:00,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:00,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:00,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:00,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:00,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:00,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:00,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:12:00,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:12:00,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:00,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:00,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:00,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:00,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:00,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:00,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:12:00,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:12:00,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:00,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:00,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:00,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:00,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:00,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:00,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:00,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:00,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:00,159 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:00,160 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:12:00,160 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:12:00,160 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:00,160 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:00,161 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:00,161 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))_1 Supporting invariants [] [2018-11-23 13:12:00,179 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 13:12:00,180 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:12:00,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:00,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:00,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:00,209 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:12:00,209 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 13:12:00,220 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-11-23 13:12:00,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 13:12:00,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-11-23 13:12:00,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:00,221 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:12:00,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:00,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:00,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:00,249 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:12:00,249 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 13:12:00,260 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-11-23 13:12:00,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 13:12:00,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-11-23 13:12:00,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:00,263 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:12:00,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:00,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:00,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:00,298 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:12:00,299 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 13:12:00,311 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2018-11-23 13:12:00,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-23 13:12:00,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2018-11-23 13:12:00,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:00,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2018-11-23 13:12:00,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:00,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-23 13:12:00,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:00,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2018-11-23 13:12:00,313 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:12:00,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-11-23 13:12:00,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:12:00,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:12:00,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:12:00,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:12:00,313 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:00,313 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:00,313 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:00,314 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 13:12:00,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:00,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:12:00,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 13:12:00,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:12:00 BoogieIcfgContainer [2018-11-23 13:12:00,318 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:12:00,319 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:00,319 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:00,319 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:00,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:57" (3/4) ... [2018-11-23 13:12:00,322 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:12:00,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:00,322 INFO L168 Benchmark]: Toolchain (without parser) took 3843.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -98.3 MB). Peak memory consumption was 100.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:12:00,323 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:12:00,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:12:00,324 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:12:00,324 INFO L168 Benchmark]: Boogie Preprocessor took 17.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:12:00,325 INFO L168 Benchmark]: RCFGBuilder took 182.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:12:00,325 INFO L168 Benchmark]: BuchiAutomizer took 3273.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.6 MB). Peak memory consumption was 110.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:12:00,326 INFO L168 Benchmark]: Witness Printer took 3.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:12:00,328 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.91 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 182.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3273.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.6 MB). Peak memory consumption was 110.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.09 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 unknown-#length-unknown[arr] + -4 * i + -1 * arr and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + unknown-#length-unknown[arr] + -4 * j and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr + 4 * j] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. 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, 9 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: 109 SDtfs, 223 SDslu, 89 SDs, 0 SdLazy, 190 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital129 mio100 ax100 hnf98 lsp94 ukn78 mio100 lsp57 div100 bol100 ite100 ukn100 eq159 hnf91 smp90 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms 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...