./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/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 3e28603c63113c1566dc2e06da17c63059f80486 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:45:03,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:45:03,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:45:03,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:45:03,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:45:03,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:45:03,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:45:03,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:45:03,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:45:03,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:45:03,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:45:03,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:45:03,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:45:03,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:45:03,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:45:03,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:45:03,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:45:03,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:45:03,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:45:03,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:45:03,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:45:03,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:45:03,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:45:03,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:45:03,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:45:03,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:45:03,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:45:03,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:45:03,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:45:03,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:45:03,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:45:03,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:45:03,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:45:03,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:45:03,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:45:03,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:45:03,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:45:03,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:45:03,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:45:03,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:45:03,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:45:03,981 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:45:03,997 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:45:03,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:45:03,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:45:03,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:45:03,999 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:45:03,999 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:45:03,999 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:45:04,000 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:45:04,000 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:45:04,000 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:45:04,000 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:45:04,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:45:04,001 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:45:04,001 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:45:04,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:45:04,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:45:04,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:45:04,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:45:04,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:45:04,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:45:04,002 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:45:04,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:45:04,002 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:45:04,003 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:45:04,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:45:04,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:45:04,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:45:04,003 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:45:04,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:45:04,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:45:04,004 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:45:04,005 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:45:04,005 INFO L138 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/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/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 -> 3e28603c63113c1566dc2e06da17c63059f80486 [2019-11-15 22:45:04,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:45:04,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:45:04,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:45:04,044 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:45:04,044 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:45:04,045 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2019-11-15 22:45:04,091 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/uautomizer/data/600d473bb/3dd1003694cc495a95d1350b4ea17087/FLAG9bb16c9b3 [2019-11-15 22:45:04,538 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:45:04,538 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2019-11-15 22:45:04,552 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/uautomizer/data/600d473bb/3dd1003694cc495a95d1350b4ea17087/FLAG9bb16c9b3 [2019-11-15 22:45:05,062 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/uautomizer/data/600d473bb/3dd1003694cc495a95d1350b4ea17087 [2019-11-15 22:45:05,065 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:45:05,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:45:05,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:45:05,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:45:05,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:45:05,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:45:05" (1/1) ... [2019-11-15 22:45:05,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d726a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:05, skipping insertion in model container [2019-11-15 22:45:05,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:45:05" (1/1) ... [2019-11-15 22:45:05,081 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:45:05,135 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:45:05,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:45:05,453 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:45:05,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:45:05,555 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:45:05,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:05 WrapperNode [2019-11-15 22:45:05,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:45:05,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:45:05,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:45:05,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:45:05,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:05" (1/1) ... [2019-11-15 22:45:05,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:05" (1/1) ... [2019-11-15 22:45:05,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:45:05,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:45:05,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:45:05,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:45:05,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:05" (1/1) ... [2019-11-15 22:45:05,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:05" (1/1) ... [2019-11-15 22:45:05,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:05" (1/1) ... [2019-11-15 22:45:05,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:05" (1/1) ... [2019-11-15 22:45:05,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:05" (1/1) ... [2019-11-15 22:45:05,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:05" (1/1) ... [2019-11-15 22:45:05,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:05" (1/1) ... [2019-11-15 22:45:05,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:45:05,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:45:05,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:45:05,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:45:05,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/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 [2019-11-15 22:45:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:45:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:45:05,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:45:05,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:45:05,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:45:05,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:45:06,028 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:45:06,028 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:45:06,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:45:06 BoogieIcfgContainer [2019-11-15 22:45:06,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:45:06,029 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:45:06,030 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:45:06,033 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:45:06,033 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:45:06,033 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:45:05" (1/3) ... [2019-11-15 22:45:06,034 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19d40b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:45:06, skipping insertion in model container [2019-11-15 22:45:06,034 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:45:06,035 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:05" (2/3) ... [2019-11-15 22:45:06,035 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19d40b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:45:06, skipping insertion in model container [2019-11-15 22:45:06,035 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:45:06,035 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:45:06" (3/3) ... [2019-11-15 22:45:06,037 INFO L371 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-1.i [2019-11-15 22:45:06,078 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:45:06,078 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:45:06,078 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:45:06,079 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:45:06,079 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:45:06,079 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:45:06,079 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:45:06,079 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:45:06,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 22:45:06,112 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 22:45:06,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:06,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:06,119 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:45:06,119 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:45:06,119 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:45:06,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 22:45:06,121 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 22:45:06,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:06,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:06,122 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:45:06,122 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:45:06,129 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#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; 3#L516true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 7#L516-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 18#L518true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 4#L519-3true [2019-11-15 22:45:06,129 INFO L793 eck$LassoCheckResult]: Loop: 4#L519-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 13#L521true assume main_~val~0 < 0;main_~val~0 := 0; 16#L521-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 20#L519-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4#L519-3true [2019-11-15 22:45:06,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:06,133 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-15 22:45:06,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:06,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841057908] [2019-11-15 22:45:06,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:06,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:06,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:06,236 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:06,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:06,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2019-11-15 22:45:06,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:06,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236291248] [2019-11-15 22:45:06,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:06,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:06,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:06,257 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:06,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:06,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2019-11-15 22:45:06,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:06,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175078652] [2019-11-15 22:45:06,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:06,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:06,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:06,297 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:06,493 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-11-15 22:45:06,546 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:06,547 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:06,547 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:06,547 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:06,547 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:06,547 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:06,548 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:06,548 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:06,548 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration1_Lasso [2019-11-15 22:45:06,548 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:06,548 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:06,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:06,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:07,105 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:07,111 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:07,114 INFO L120 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 [2019-11-15 22:45:07,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:07,116 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:07,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:07,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:07,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:07,120 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:07,121 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:07,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:07,132 INFO L120 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 [2019-11-15 22:45:07,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:07,134 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:07,135 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:07,135 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:07,135 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:07,136 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:07,136 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:07,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:07,144 INFO L120 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 [2019-11-15 22:45:07,146 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:07,147 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:07,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:07,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:07,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:07,149 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:07,149 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:07,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:07,152 INFO L120 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 [2019-11-15 22:45:07,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:07,154 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:07,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:07,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:07,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:07,156 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:07,158 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:07,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:07,161 INFO L120 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 [2019-11-15 22:45:07,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:07,162 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:07,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:07,162 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:07,162 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:07,163 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:07,163 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:07,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:07,167 INFO L120 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 [2019-11-15 22:45:07,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:07,169 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:45:07,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:07,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:07,179 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:45:07,179 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:07,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:07,221 INFO L120 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 [2019-11-15 22:45:07,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:07,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:07,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:07,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:07,226 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:07,228 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:07,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:07,260 INFO L120 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 [2019-11-15 22:45:07,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:07,262 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:07,263 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:07,263 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:07,267 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:07,268 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:07,416 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:07,493 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 22:45:07,502 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 22:45:07,505 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:07,509 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:45:07,509 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:07,510 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2019-11-15 22:45:07,522 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 22:45:07,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:45:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:07,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:07,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:07,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:45:07,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:07,628 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 [2019-11-15 22:45:07,630 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2019-11-15 22:45:07,688 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. [2019-11-15 22:45:07,689 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 [2019-11-15 22:45:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:45:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2019-11-15 22:45:07,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 22:45:07,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:07,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-15 22:45:07,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:07,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 22:45:07,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:07,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2019-11-15 22:45:07,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:45:07,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-11-15 22:45:07,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:45:07,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 22:45:07,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-11-15 22:45:07,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:45:07,707 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 22:45:07,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-11-15 22:45:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 22:45:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 22:45:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-15 22:45:07,732 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 22:45:07,733 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 22:45:07,733 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:45:07,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-15 22:45:07,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:45:07,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:07,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:07,735 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:45:07,735 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:45:07,735 INFO L791 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 138#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; 127#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 128#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 137#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 129#L519-3 assume !(main_~i~0 < main_~length~0); 130#L519-4 main_~j~0 := 0; 136#L526-3 [2019-11-15 22:45:07,735 INFO L793 eck$LassoCheckResult]: Loop: 136#L526-3 assume !!(main_~j~0 < main_~length~0); 135#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 133#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 134#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 136#L526-3 [2019-11-15 22:45:07,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:07,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2019-11-15 22:45:07,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:07,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530045262] [2019-11-15 22:45:07,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:07,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:07,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:07,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530045262] [2019-11-15 22:45:07,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:45:07,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:45:07,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639421584] [2019-11-15 22:45:07,794 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:45:07,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:07,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2019-11-15 22:45:07,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:07,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19761076] [2019-11-15 22:45:07,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:07,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:07,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:07,813 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:07,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:45:07,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:45:07,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:45:07,874 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-15 22:45:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:45:07,908 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-15 22:45:07,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:45:07,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-15 22:45:07,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:45:07,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2019-11-15 22:45:07,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 22:45:07,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 22:45:07,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-11-15 22:45:07,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:45:07,912 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-15 22:45:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-11-15 22:45:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-11-15 22:45:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 22:45:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-15 22:45:07,914 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 22:45:07,914 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 22:45:07,914 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:45:07,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-15 22:45:07,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:45:07,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:07,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:07,916 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:45:07,916 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:45:07,916 INFO L791 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#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; 167#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 168#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 177#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 169#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 170#L521 assume !(main_~val~0 < 0); 179#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 181#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 171#L519-3 assume !(main_~i~0 < main_~length~0); 172#L519-4 main_~j~0 := 0; 176#L526-3 [2019-11-15 22:45:07,916 INFO L793 eck$LassoCheckResult]: Loop: 176#L526-3 assume !!(main_~j~0 < main_~length~0); 175#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 173#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 174#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 176#L526-3 [2019-11-15 22:45:07,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2019-11-15 22:45:07,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:07,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598638182] [2019-11-15 22:45:07,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:07,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:07,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:07,938 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:07,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2019-11-15 22:45:07,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:07,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206315880] [2019-11-15 22:45:07,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:07,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:07,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:07,948 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:07,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:07,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2019-11-15 22:45:07,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:07,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359944285] [2019-11-15 22:45:07,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:07,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:07,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:07,981 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:08,184 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-11-15 22:45:08,249 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:08,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:08,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:08,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:08,250 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:08,250 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:08,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:08,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:08,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration3_Lasso [2019-11-15 22:45:08,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:08,250 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:08,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,388 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-11-15 22:45:08,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:08,657 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:08,658 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:08,658 INFO L120 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 [2019-11-15 22:45:08,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:08,659 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:08,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:08,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:08,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:08,660 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:08,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:08,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:08,661 INFO L120 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 [2019-11-15 22:45:08,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:08,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:08,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:08,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:08,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:08,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:08,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:08,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:08,663 INFO L120 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 [2019-11-15 22:45:08,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:08,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:08,663 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:08,663 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:08,666 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:08,666 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:08,702 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:08,737 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 22:45:08,738 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 22:45:08,738 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:08,739 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 22:45:08,740 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:08,740 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [-1*ULTIMATE.start_main_~length~0 + 1 >= 0] [2019-11-15 22:45:08,769 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 22:45:08,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:08,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:45:08,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:08,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:45:08,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:08,925 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-11-15 22:45:08,926 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 6 states. [2019-11-15 22:45:09,124 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 41 states and 53 transitions. Complement of second has 11 states. [2019-11-15 22:45:09,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-15 22:45:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 22:45:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-11-15 22:45:09,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-15 22:45:09,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:09,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 22:45:09,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:09,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 11 letters. Loop has 8 letters. [2019-11-15 22:45:09,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:09,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-11-15 22:45:09,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:45:09,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 52 transitions. [2019-11-15 22:45:09,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 22:45:09,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-15 22:45:09,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 52 transitions. [2019-11-15 22:45:09,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:09,131 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-11-15 22:45:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 52 transitions. [2019-11-15 22:45:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-11-15 22:45:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 22:45:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-11-15 22:45:09,139 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-11-15 22:45:09,139 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-11-15 22:45:09,139 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:45:09,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2019-11-15 22:45:09,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:45:09,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:09,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:09,145 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:45:09,145 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:45:09,146 INFO L791 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 347#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; 329#L516 assume main_~length~0 < 1 || main_~length~0 >= 536870911;main_~length~0 := 1; 330#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 352#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 332#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 333#L521 assume !(main_~val~0 < 0); 361#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 353#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 354#L519-3 assume !(main_~i~0 < main_~length~0); 357#L519-4 main_~j~0 := 0; 355#L526-3 assume !!(main_~j~0 < main_~length~0); 338#L527-3 [2019-11-15 22:45:09,146 INFO L793 eck$LassoCheckResult]: Loop: 338#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 337#L527-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; 338#L527-3 [2019-11-15 22:45:09,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:09,147 INFO L82 PathProgramCache]: Analyzing trace with hash 2113338830, now seen corresponding path program 1 times [2019-11-15 22:45:09,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:09,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077888752] [2019-11-15 22:45:09,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:09,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:09,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:09,187 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:09,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:09,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2019-11-15 22:45:09,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:09,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120804576] [2019-11-15 22:45:09,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:09,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:09,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:09,206 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:09,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:09,210 INFO L82 PathProgramCache]: Analyzing trace with hash -600913837, now seen corresponding path program 1 times [2019-11-15 22:45:09,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:09,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449446096] [2019-11-15 22:45:09,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:09,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:09,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:09,248 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:09,430 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-11-15 22:45:09,485 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:09,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:09,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:09,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:09,485 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:09,485 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:09,485 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:09,485 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:09,486 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration4_Lasso [2019-11-15 22:45:09,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:09,486 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:09,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:09,887 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:09,888 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:09,888 INFO L120 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 [2019-11-15 22:45:09,888 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:09,889 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:09,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:09,889 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:09,889 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:09,889 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:09,889 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:09,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:09,890 INFO L120 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 [2019-11-15 22:45:09,890 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:09,891 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:09,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:09,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:09,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:09,891 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:09,891 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:09,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:09,892 INFO L120 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 [2019-11-15 22:45:09,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:09,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:09,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:09,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:09,893 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:09,894 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:09,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:09,895 INFO L120 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 [2019-11-15 22:45:09,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:09,896 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:09,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:09,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:09,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:09,897 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:09,897 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:09,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:09,898 INFO L120 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 [2019-11-15 22:45:09,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:09,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:09,898 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:09,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:09,899 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:09,899 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:09,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:09,902 INFO L120 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 [2019-11-15 22:45:09,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:09,903 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:09,903 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:09,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:09,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:09,904 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:09,904 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:09,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:09,905 INFO L120 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 [2019-11-15 22:45:09,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:09,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:09,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:09,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:09,907 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:09,907 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:09,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:09,910 INFO L120 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 [2019-11-15 22:45:09,911 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:09,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:09,911 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:09,911 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:09,913 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:09,913 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:09,926 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:09,931 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:09,931 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:45:09,932 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:09,933 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:45:09,933 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:09,933 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2019-11-15 22:45:09,961 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 22:45:09,965 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:45:09,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:10,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:10,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:10,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:45:10,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:10,034 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 [2019-11-15 22:45:10,034 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-11-15 22:45:10,061 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 50 states and 65 transitions. Complement of second has 7 states. [2019-11-15 22:45:10,062 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 [2019-11-15 22:45:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:45:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 22:45:10,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-15 22:45:10,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:10,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-15 22:45:10,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:10,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-15 22:45:10,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:10,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2019-11-15 22:45:10,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:45:10,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 44 states and 57 transitions. [2019-11-15 22:45:10,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-15 22:45:10,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 22:45:10,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 57 transitions. [2019-11-15 22:45:10,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:10,070 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 57 transitions. [2019-11-15 22:45:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 57 transitions. [2019-11-15 22:45:10,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-15 22:45:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 22:45:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2019-11-15 22:45:10,077 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-11-15 22:45:10,077 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-11-15 22:45:10,077 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:45:10,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2019-11-15 22:45:10,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:45:10,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:10,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:10,083 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:45:10,084 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:45:10,084 INFO L791 eck$LassoCheckResult]: Stem: 516#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 514#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; 499#L516 assume main_~length~0 < 1 || main_~length~0 >= 536870911;main_~length~0 := 1; 500#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 507#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 495#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 496#L521 assume !(main_~val~0 < 0); 515#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 517#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 497#L519-3 assume !(main_~i~0 < main_~length~0); 498#L519-4 main_~j~0 := 0; 506#L526-3 assume !!(main_~j~0 < main_~length~0); 513#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 504#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 505#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 512#L526-3 assume !!(main_~j~0 < main_~length~0); 503#L527-3 [2019-11-15 22:45:10,084 INFO L793 eck$LassoCheckResult]: Loop: 503#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 502#L527-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; 503#L527-3 [2019-11-15 22:45:10,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1952579805, now seen corresponding path program 1 times [2019-11-15 22:45:10,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:10,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749966178] [2019-11-15 22:45:10,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:10,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749966178] [2019-11-15 22:45:10,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612126346] [2019-11-15 22:45:10,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:45:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:10,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:45:10,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:45:10,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:45:10,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-15 22:45:10,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500455123] [2019-11-15 22:45:10,327 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:45:10,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2019-11-15 22:45:10,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:10,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534429570] [2019-11-15 22:45:10,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:10,332 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:10,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:45:10,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:45:10,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:45:10,365 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. cyclomatic complexity: 20 Second operand 5 states. [2019-11-15 22:45:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:45:10,413 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2019-11-15 22:45:10,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:45:10,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 62 transitions. [2019-11-15 22:45:10,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:45:10,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 45 transitions. [2019-11-15 22:45:10,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 22:45:10,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 22:45:10,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2019-11-15 22:45:10,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:10,416 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-15 22:45:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2019-11-15 22:45:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-15 22:45:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 22:45:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2019-11-15 22:45:10,419 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-15 22:45:10,419 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-15 22:45:10,419 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:45:10,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2019-11-15 22:45:10,420 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:45:10,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:10,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:10,421 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:45:10,421 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:45:10,421 INFO L791 eck$LassoCheckResult]: Stem: 667#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 665#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; 645#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 646#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 657#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 647#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 648#L521 assume !(main_~val~0 < 0); 666#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 668#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 649#L519-3 assume !(main_~i~0 < main_~length~0); 650#L519-4 main_~j~0 := 0; 656#L526-3 assume !!(main_~j~0 < main_~length~0); 655#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 670#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 660#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 661#L526-3 assume !!(main_~j~0 < main_~length~0); 653#L527-3 [2019-11-15 22:45:10,421 INFO L793 eck$LassoCheckResult]: Loop: 653#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 652#L527-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; 653#L527-3 [2019-11-15 22:45:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:10,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2019-11-15 22:45:10,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:10,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512409778] [2019-11-15 22:45:10,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:10,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512409778] [2019-11-15 22:45:10,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226625305] [2019-11-15 22:45:10,531 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a33a9102-c389-4ea6-b1a2-63a71451a634/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:45:10,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:45:10,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:45:10,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:45:10,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:10,666 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:45:10,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-11-15 22:45:10,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256762630] [2019-11-15 22:45:10,667 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:45:10,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2019-11-15 22:45:10,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:10,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806094064] [2019-11-15 22:45:10,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:10,678 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:10,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:45:10,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:45:10,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:45:10,702 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 16 Second operand 14 states. [2019-11-15 22:45:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:45:10,857 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-11-15 22:45:10,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:45:10,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2019-11-15 22:45:10,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:45:10,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 27 states and 34 transitions. [2019-11-15 22:45:10,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:45:10,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:45:10,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-11-15 22:45:10,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:10,858 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-15 22:45:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-11-15 22:45:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-11-15 22:45:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 22:45:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-15 22:45:10,860 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-15 22:45:10,860 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-15 22:45:10,860 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:45:10,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2019-11-15 22:45:10,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:45:10,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:10,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:10,861 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:45:10,861 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:45:10,861 INFO L791 eck$LassoCheckResult]: Stem: 802#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 800#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; 784#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 785#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 796#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 786#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 787#L521 assume !(main_~val~0 < 0); 807#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 804#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 788#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 789#L521 assume !(main_~val~0 < 0); 801#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 803#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 806#L519-3 assume !(main_~i~0 < main_~length~0); 794#L519-4 main_~j~0 := 0; 795#L526-3 assume !!(main_~j~0 < main_~length~0); 805#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 790#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 791#L526-2 [2019-11-15 22:45:10,861 INFO L793 eck$LassoCheckResult]: Loop: 791#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 799#L526-3 assume !!(main_~j~0 < main_~length~0); 797#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 798#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 791#L526-2 [2019-11-15 22:45:10,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:10,861 INFO L82 PathProgramCache]: Analyzing trace with hash -983203256, now seen corresponding path program 1 times [2019-11-15 22:45:10,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:10,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175000757] [2019-11-15 22:45:10,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:10,878 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:10,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2664470, now seen corresponding path program 3 times [2019-11-15 22:45:10,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:10,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369810154] [2019-11-15 22:45:10,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:10,885 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:10,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:10,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461475, now seen corresponding path program 3 times [2019-11-15 22:45:10,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:10,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061602797] [2019-11-15 22:45:10,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:10,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:10,904 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:11,123 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-11-15 22:45:11,174 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:11,174 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:11,174 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:11,174 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:11,175 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:11,175 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:11,175 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:11,175 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:11,175 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration7_Lasso [2019-11-15 22:45:11,175 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:11,175 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:11,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:11,538 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:11,539 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:11,539 INFO L120 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 [2019-11-15 22:45:11,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:11,540 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:11,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:11,540 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:11,540 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:11,541 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:11,541 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:11,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:11,542 INFO L120 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 [2019-11-15 22:45:11,542 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:11,542 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:11,542 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:11,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:11,543 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:11,543 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:11,543 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:11,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:11,544 INFO L120 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 [2019-11-15 22:45:11,544 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:11,544 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:11,544 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:11,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:11,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:11,547 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:11,547 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:11,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:11,548 INFO L120 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 [2019-11-15 22:45:11,548 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:11,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:11,549 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:11,549 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:11,549 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:11,550 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:11,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:11,552 INFO L120 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 [2019-11-15 22:45:11,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:11,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:11,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:11,553 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:11,556 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:11,556 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:11,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:11,559 INFO L120 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 [2019-11-15 22:45:11,559 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:11,560 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:45:11,560 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:11,560 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:11,561 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:45:11,561 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:11,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:11,568 INFO L120 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 [2019-11-15 22:45:11,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:11,569 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:11,569 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:11,570 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:11,570 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:11,570 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:11,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:11,572 INFO L120 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 [2019-11-15 22:45:11,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:11,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:11,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:11,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:11,583 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:11,583 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:11,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:11,598 INFO L120 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 [2019-11-15 22:45:11,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:11,599 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:11,599 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:11,599 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:11,600 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:11,600 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:11,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:11,603 INFO L120 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 [2019-11-15 22:45:11,604 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:11,604 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:11,606 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:11,606 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:11,607 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:11,608 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:11,634 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:11,668 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 22:45:11,668 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 22:45:11,668 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:11,669 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:45:11,670 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:11,670 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-15 22:45:11,675 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 22:45:11,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:11,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:11,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:11,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:45:11,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:11,732 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:45:11,732 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-15 22:45:11,756 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 32 states and 40 transitions. Complement of second has 6 states. [2019-11-15 22:45:11,757 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 [2019-11-15 22:45:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:45:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-15 22:45:11,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 4 letters. [2019-11-15 22:45:11,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:11,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 22 letters. Loop has 4 letters. [2019-11-15 22:45:11,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:11,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 8 letters. [2019-11-15 22:45:11,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:11,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2019-11-15 22:45:11,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:45:11,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 36 transitions. [2019-11-15 22:45:11,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 22:45:11,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:45:11,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-11-15 22:45:11,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:11,761 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-15 22:45:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-11-15 22:45:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-15 22:45:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 22:45:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-15 22:45:11,763 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-15 22:45:11,763 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-15 22:45:11,763 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 22:45:11,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2019-11-15 22:45:11,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:45:11,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:11,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:11,764 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:45:11,764 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:45:11,764 INFO L791 eck$LassoCheckResult]: Stem: 964#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 962#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; 942#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 943#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 954#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 944#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 945#L521 assume !(main_~val~0 < 0); 963#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 965#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 946#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 947#L521 assume !(main_~val~0 < 0); 969#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 968#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 967#L519-3 assume !(main_~i~0 < main_~length~0); 952#L519-4 main_~j~0 := 0; 953#L526-3 assume !!(main_~j~0 < main_~length~0); 960#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 966#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 957#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 958#L526-3 assume !!(main_~j~0 < main_~length~0); 961#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 948#L527-1 [2019-11-15 22:45:11,764 INFO L793 eck$LassoCheckResult]: Loop: 948#L527-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; 949#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 948#L527-1 [2019-11-15 22:45:11,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:11,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1068815382, now seen corresponding path program 4 times [2019-11-15 22:45:11,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:11,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116551787] [2019-11-15 22:45:11,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:11,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:11,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:11,782 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:11,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2652, now seen corresponding path program 4 times [2019-11-15 22:45:11,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:11,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681545469] [2019-11-15 22:45:11,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:11,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:11,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:11,788 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:11,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:11,789 INFO L82 PathProgramCache]: Analyzing trace with hash 634400049, now seen corresponding path program 1 times [2019-11-15 22:45:11,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:11,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145765388] [2019-11-15 22:45:11,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:11,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:11,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:11,814 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:12,093 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 90 [2019-11-15 22:45:12,140 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:12,140 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:12,140 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:12,140 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:12,140 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:12,140 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:12,140 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:12,141 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:12,141 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration8_Lasso [2019-11-15 22:45:12,141 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:12,141 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:12,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:12,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:12,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:12,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:12,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:12,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:12,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:12,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:12,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:12,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:12,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:12,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:12,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:45:12,507 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:12,507 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:12,507 INFO L120 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 [2019-11-15 22:45:12,508 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:12,508 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:12,508 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:12,508 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:12,508 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:12,509 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:12,509 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:12,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:12,509 INFO L120 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 [2019-11-15 22:45:12,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:12,510 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:12,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:12,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:12,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:12,510 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:12,510 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:12,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:12,511 INFO L120 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 [2019-11-15 22:45:12,511 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:12,512 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:12,512 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:12,512 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:12,512 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:12,512 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:12,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:12,514 INFO L120 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 [2019-11-15 22:45:12,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:12,514 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:12,514 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:12,514 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:12,514 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:12,515 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:12,515 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:12,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:12,515 INFO L120 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 [2019-11-15 22:45:12,516 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:12,516 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:12,516 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:12,516 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:12,516 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:12,516 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:12,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:12,518 INFO L120 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 [2019-11-15 22:45:12,518 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:12,518 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:12,518 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:12,518 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:12,519 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:12,520 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:12,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:12,527 INFO L120 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 [2019-11-15 22:45:12,528 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:12,528 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:12,528 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:12,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:12,529 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:12,529 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:12,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:12,531 INFO L120 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 [2019-11-15 22:45:12,531 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:12,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:12,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:12,532 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:12,532 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:12,532 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:12,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:12,534 INFO L120 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 [2019-11-15 22:45:12,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:12,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:12,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:12,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:12,535 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:12,535 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:12,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:12,537 INFO L120 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 [2019-11-15 22:45:12,537 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:12,537 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:12,537 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:12,538 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:12,538 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:12,539 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:12,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:12,542 INFO L120 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 [2019-11-15 22:45:12,542 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:12,543 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:45:12,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:12,543 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:12,544 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:45:12,544 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:12,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:12,548 INFO L120 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 [2019-11-15 22:45:12,548 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:12,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:12,549 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:12,549 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:12,550 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:12,550 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:12,556 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:12,561 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:45:12,561 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:45:12,562 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:12,562 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 22:45:12,563 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:12,563 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = 1*ULTIMATE.start_main_#t~mem7 Supporting invariants [1*ULTIMATE.start_main_#t~mem7 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))_1 >= 0] [2019-11-15 22:45:12,578 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-11-15 22:45:12,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:12,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:45:12,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:12,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:45:12,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:12,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-11-15 22:45:12,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:45:12,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:45:12,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:45:12,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:17 [2019-11-15 22:45:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:12,685 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 [2019-11-15 22:45:12,685 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 22:45:12,723 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2019-11-15 22:45:12,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:45:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-15 22:45:12,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 21 letters. Loop has 2 letters. [2019-11-15 22:45:12,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:12,724 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:12,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:12,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:45:12,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:12,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:45:12,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:12,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-11-15 22:45:12,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:45:12,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:45:12,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:45:12,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:17 [2019-11-15 22:45:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:12,806 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 [2019-11-15 22:45:12,806 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 22:45:12,842 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2019-11-15 22:45:12,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:45:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-15 22:45:12,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 21 letters. Loop has 2 letters. [2019-11-15 22:45:12,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:12,844 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:45:12,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:12,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:45:12,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:12,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:45:12,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:12,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-11-15 22:45:12,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:45:12,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:45:12,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:45:12,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:17 [2019-11-15 22:45:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:45:12,919 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 [2019-11-15 22:45:12,920 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 22:45:12,949 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 32 states and 40 transitions. Complement of second has 4 states. [2019-11-15 22:45:12,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:45:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-11-15 22:45:12,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 21 letters. Loop has 2 letters. [2019-11-15 22:45:12,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:12,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 23 letters. Loop has 2 letters. [2019-11-15 22:45:12,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:12,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 21 letters. Loop has 4 letters. [2019-11-15 22:45:12,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:12,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2019-11-15 22:45:12,952 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:45:12,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-11-15 22:45:12,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:45:12,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:45:12,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:45:12,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:45:12,952 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:45:12,952 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:45:12,952 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:45:12,952 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 22:45:12,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:45:12,953 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:45:12,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:45:12,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:45:12 BoogieIcfgContainer [2019-11-15 22:45:12,958 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:45:12,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:45:12,959 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:45:12,959 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:45:12,959 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:45:06" (3/4) ... [2019-11-15 22:45:12,963 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:45:12,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:45:12,965 INFO L168 Benchmark]: Toolchain (without parser) took 7897.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 937.1 MB in the beginning and 1.0 GB in the end (delta: -86.9 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:12,965 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:45:12,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:12,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.41 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. [2019-11-15 22:45:12,967 INFO L168 Benchmark]: Boogie Preprocessor took 56.55 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. [2019-11-15 22:45:12,967 INFO L168 Benchmark]: RCFGBuilder took 362.09 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. [2019-11-15 22:45:12,968 INFO L168 Benchmark]: BuchiAutomizer took 6928.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.3 MB). Peak memory consumption was 131.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:12,968 INFO L168 Benchmark]: Witness Printer took 4.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:45:12,971 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 490.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.41 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. * Boogie Preprocessor took 56.55 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. * RCFGBuilder took 362.09 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 6928.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.3 MB). Peak memory consumption was 131.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function -2 * j + 1 and consists of 9 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. One deterministic module has affine ranking function -1 * j + length and consists of 4 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@333ba08d and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 137 SDtfs, 236 SDslu, 113 SDs, 0 SdLazy, 219 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax113 hnf98 lsp83 ukn77 mio100 lsp56 div100 bol100 ite100 ukn100 eq162 hnf90 smp91 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms VariablesStem: 3 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...