./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/NonTermination3-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination3-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/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 64bit --witnessprinter.graph.data.programhash b10c0555613e3e1e99ee574b69e31152fe0aa7f9 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:56:46,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:56:46,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:56:46,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:56:46,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:56:46,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:56:46,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:56:46,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:56:46,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:56:46,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:56:46,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:56:46,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:56:46,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:56:46,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:56:46,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:56:46,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:56:46,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:56:46,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:56:46,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:56:46,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:56:46,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:56:46,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:56:46,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:56:46,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:56:46,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:56:46,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:56:46,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:56:46,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:56:46,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:56:46,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:56:46,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:56:46,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:56:46,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:56:46,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:56:46,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:56:46,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:56:46,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:56:46,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:56:46,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:56:46,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:56:46,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:56:46,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-11-30 00:56:46,968 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:56:46,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:56:46,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:56:46,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:56:46,971 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:56:46,971 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 00:56:46,972 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 00:56:46,972 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 00:56:46,972 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 00:56:46,972 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 00:56:46,973 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 00:56:46,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:56:46,973 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:56:46,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:56:46,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:56:46,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 00:56:46,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 00:56:46,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 00:56:46,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:56:46,975 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 00:56:46,975 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:56:46,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 00:56:46,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:56:46,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:56:46,976 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 00:56:46,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:56:46,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:56:46,977 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:56:46,977 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 00:56:46,979 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 00:56:46,979 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_f9b8c241-c184-4146-8ef5-917e01614930/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b10c0555613e3e1e99ee574b69e31152fe0aa7f9 [2020-11-30 00:56:47,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:56:47,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:56:47,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:56:47,306 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:56:47,311 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:56:47,312 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2020-11-30 00:56:47,430 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/data/b31b32877/5d6d3b3f8e7547ac8005e8e54ad5af79/FLAG6f8b5fa26 [2020-11-30 00:56:48,050 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:56:48,051 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2020-11-30 00:56:48,059 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/data/b31b32877/5d6d3b3f8e7547ac8005e8e54ad5af79/FLAG6f8b5fa26 [2020-11-30 00:56:48,425 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/data/b31b32877/5d6d3b3f8e7547ac8005e8e54ad5af79 [2020-11-30 00:56:48,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:56:48,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:56:48,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:56:48,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:56:48,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:56:48,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:56:48" (1/1) ... [2020-11-30 00:56:48,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713c6600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:48, skipping insertion in model container [2020-11-30 00:56:48,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:56:48" (1/1) ... [2020-11-30 00:56:48,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:56:48,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:56:48,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:56:48,679 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:56:48,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:56:48,751 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:56:48,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:48 WrapperNode [2020-11-30 00:56:48,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:56:48,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:56:48,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:56:48,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:56:48,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:48" (1/1) ... [2020-11-30 00:56:48,785 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:48" (1/1) ... [2020-11-30 00:56:48,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:56:48,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:56:48,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:56:48,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:56:48,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:48" (1/1) ... [2020-11-30 00:56:48,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:48" (1/1) ... [2020-11-30 00:56:48,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:48" (1/1) ... [2020-11-30 00:56:48,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:48" (1/1) ... [2020-11-30 00:56:48,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:48" (1/1) ... [2020-11-30 00:56:48,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:48" (1/1) ... [2020-11-30 00:56:48,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:48" (1/1) ... [2020-11-30 00:56:48,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:56:48,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:56:48,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:56:48,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:56:48,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/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 [2020-11-30 00:56:48,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:56:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:56:48,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:56:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 00:56:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:56:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:56:49,226 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:56:49,227 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-30 00:56:49,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:56:49 BoogieIcfgContainer [2020-11-30 00:56:49,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:56:49,231 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 00:56:49,231 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 00:56:49,236 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 00:56:49,237 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:56:49,237 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 12:56:48" (1/3) ... [2020-11-30 00:56:49,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b5f5f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:56:49, skipping insertion in model container [2020-11-30 00:56:49,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:56:49,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:56:48" (2/3) ... [2020-11-30 00:56:49,241 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b5f5f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:56:49, skipping insertion in model container [2020-11-30 00:56:49,241 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:56:49,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:56:49" (3/3) ... [2020-11-30 00:56:49,244 INFO L373 chiAutomizerObserver]: Analyzing ICFG NonTermination3-2.c [2020-11-30 00:56:49,313 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 00:56:49,313 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 00:56:49,314 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 00:56:49,314 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:56:49,314 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:56:49,314 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 00:56:49,314 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:56:49,314 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 00:56:49,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-11-30 00:56:49,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-11-30 00:56:49,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:56:49,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:56:49,374 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:56:49,374 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:56:49,374 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 00:56:49,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-11-30 00:56:49,389 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-11-30 00:56:49,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:56:49,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:56:49,397 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 00:56:49,397 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:56:49,406 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 5#L13-3true [2020-11-30 00:56:49,407 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-3true assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 8#L13-2true main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 5#L13-3true [2020-11-30 00:56:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-30 00:56:49,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:49,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240532228] [2020-11-30 00:56:49,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:49,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:49,558 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:49,582 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:49,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:49,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-11-30 00:56:49,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:49,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565921760] [2020-11-30 00:56:49,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:49,600 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:49,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:49,615 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:49,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:49,618 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-11-30 00:56:49,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:49,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101021470] [2020-11-30 00:56:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:49,646 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:49,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:49,672 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:49,919 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-11-30 00:56:50,003 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:56:50,004 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:56:50,005 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:56:50,005 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:56:50,005 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:56:50,005 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:50,005 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:56:50,006 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:56:50,006 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-2.c_Iteration1_Lasso [2020-11-30 00:56:50,006 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:56:50,006 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:56:50,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:56:50,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:56:50,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:56:50,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:56:50,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:56:50,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:56:50,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:56:50,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:56:50,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:56:50,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:56:50,460 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:56:50,466 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:56:50,479 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 [2020-11-30 00:56:50,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:56:50,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:56:50,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:56:50,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:56:50,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:56:50,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:56:50,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:50,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:56:50,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 [2020-11-30 00:56:50,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:56:50,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:56:50,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:56:50,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:56:50,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:56:50,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:56:50,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:50,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:56:50,608 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 [2020-11-30 00:56:50,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:56:50,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:56:50,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:56:50,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:56:50,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:56:50,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:56:50,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:50,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:56:50,660 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 [2020-11-30 00:56:50,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:56:50,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:56:50,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:56:50,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:56:50,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:56:50,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:56:50,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:50,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:50,710 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 [2020-11-30 00:56:50,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:56:50,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:56:50,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:56:50,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:56:50,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:56:50,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:56:50,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:50,778 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 [2020-11-30 00:56:50,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:56:50,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:56:50,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:56:50,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:56:50,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:56:50,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:56:50,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:56:50,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:56:50,842 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 [2020-11-30 00:56:50,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:56:50,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:56:50,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:56:50,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:56:50,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:56:50,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:50,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:56:50,927 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 [2020-11-30 00:56:50,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:56:50,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:56:50,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:56:50,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:56:50,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:56:50,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:50,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:50,994 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 [2020-11-30 00:56:50,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:56:50,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:56:50,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:56:50,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:56:51,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:56:51,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:56:51,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:56:51,079 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 [2020-11-30 00:56:51,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:56:51,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:56:51,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:56:51,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:56:51,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:56:51,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:56:51,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:51,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:51,133 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 [2020-11-30 00:56:51,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:56:51,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:56:51,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:56:51,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:56:51,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:56:51,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:56:51,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:56:51,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:51,169 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 [2020-11-30 00:56:51,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:56:51,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:56:51,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:56:51,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:56:51,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:56:51,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:56:51,189 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:56:51,261 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-11-30 00:56:51,261 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:56:51,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:56:51,278 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:56:51,278 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:56:51,279 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2020-11-30 00:56:51,330 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-11-30 00:56:51,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:51,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:56:51,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:51,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:56:51,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:51,539 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 [2020-11-30 00:56:51,541 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2020-11-30 00:56:51,601 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2020-11-30 00:56:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:56:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:56:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-11-30 00:56:51,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2020-11-30 00:56:51,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:56:51,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-30 00:56:51,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:56:51,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2020-11-30 00:56:51,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:56:51,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2020-11-30 00:56:51,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:51,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2020-11-30 00:56:51,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 00:56:51,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-30 00:56:51,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-11-30 00:56:51,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:56:51,631 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-11-30 00:56:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-11-30 00:56:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-11-30 00:56:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-30 00:56:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-11-30 00:56:51,667 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-11-30 00:56:51,667 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-11-30 00:56:51,668 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 00:56:51,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-11-30 00:56:51,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:51,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:56:51,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:56:51,671 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-30 00:56:51,671 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:56:51,672 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 84#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 85#L13-3 assume !(main_~n~0 < 10); 83#L17-4 [2020-11-30 00:56:51,672 INFO L796 eck$LassoCheckResult]: Loop: 83#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 89#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 82#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 83#L17-4 [2020-11-30 00:56:51,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:51,673 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2020-11-30 00:56:51,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:51,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654735773] [2020-11-30 00:56:51,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:51,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654735773] [2020-11-30 00:56:51,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:56:51,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:56:51,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15644687] [2020-11-30 00:56:51,767 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:56:51,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:51,768 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2020-11-30 00:56:51,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:51,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80074125] [2020-11-30 00:56:51,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:51,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:51,788 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:51,791 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:51,912 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-11-30 00:56:51,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:51,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:56:51,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:56:51,957 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-11-30 00:56:51,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:51,978 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-11-30 00:56:51,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:56:51,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2020-11-30 00:56:51,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:51,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2020-11-30 00:56:51,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 00:56:51,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 00:56:51,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-11-30 00:56:51,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:56:51,982 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-11-30 00:56:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-11-30 00:56:51,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-11-30 00:56:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-30 00:56:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-11-30 00:56:51,984 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-11-30 00:56:51,984 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-11-30 00:56:51,984 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 00:56:51,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-11-30 00:56:51,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:51,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:56:51,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:56:51,990 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-30 00:56:51,990 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:56:51,991 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 105#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 106#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 109#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 110#L13-3 assume !(main_~n~0 < 10); 108#L17-4 [2020-11-30 00:56:51,991 INFO L796 eck$LassoCheckResult]: Loop: 108#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 112#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 107#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 108#L17-4 [2020-11-30 00:56:51,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:51,992 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2020-11-30 00:56:51,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:51,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551587443] [2020-11-30 00:56:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:52,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551587443] [2020-11-30 00:56:52,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493873161] [2020-11-30 00:56:52,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:56:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:52,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 00:56:52,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:52,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:56:52,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2020-11-30 00:56:52,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181643578] [2020-11-30 00:56:52,166 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:56:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:52,168 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2020-11-30 00:56:52,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:52,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538145876] [2020-11-30 00:56:52,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:52,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:52,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:52,204 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:52,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:56:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:56:52,328 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-11-30 00:56:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:52,358 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-11-30 00:56:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:56:52,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2020-11-30 00:56:52,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:52,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2020-11-30 00:56:52,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 00:56:52,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 00:56:52,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-11-30 00:56:52,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:56:52,366 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-11-30 00:56:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-11-30 00:56:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-11-30 00:56:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-11-30 00:56:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-11-30 00:56:52,371 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-11-30 00:56:52,371 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-11-30 00:56:52,372 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 00:56:52,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-11-30 00:56:52,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:52,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:56:52,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:56:52,373 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-11-30 00:56:52,373 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:56:52,374 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 144#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 145#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 148#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 149#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 150#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 153#L13-3 assume !(main_~n~0 < 10); 147#L17-4 [2020-11-30 00:56:52,374 INFO L796 eck$LassoCheckResult]: Loop: 147#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 152#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 146#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 147#L17-4 [2020-11-30 00:56:52,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:52,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2020-11-30 00:56:52,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:52,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871254035] [2020-11-30 00:56:52,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:52,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871254035] [2020-11-30 00:56:52,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827970948] [2020-11-30 00:56:52,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:56:52,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:56:52,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:56:52,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:56:52,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:52,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:56:52,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-30 00:56:52,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699576003] [2020-11-30 00:56:52,528 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:56:52,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:52,529 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2020-11-30 00:56:52,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:52,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923013336] [2020-11-30 00:56:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:52,537 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:52,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:52,546 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:52,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:52,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:56:52,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:56:52,679 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-11-30 00:56:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:52,713 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-11-30 00:56:52,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:56:52,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2020-11-30 00:56:52,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:52,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2020-11-30 00:56:52,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 00:56:52,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 00:56:52,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2020-11-30 00:56:52,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:56:52,718 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-11-30 00:56:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2020-11-30 00:56:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-11-30 00:56:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-11-30 00:56:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2020-11-30 00:56:52,720 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-11-30 00:56:52,720 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-11-30 00:56:52,721 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 00:56:52,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2020-11-30 00:56:52,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:52,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:56:52,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:56:52,722 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2020-11-30 00:56:52,722 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:56:52,723 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 196#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 197#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 198#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 199#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 200#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 205#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 204#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 203#L13-3 assume !(main_~n~0 < 10); 195#L17-4 [2020-11-30 00:56:52,723 INFO L796 eck$LassoCheckResult]: Loop: 195#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 202#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 194#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 195#L17-4 [2020-11-30 00:56:52,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:52,723 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2020-11-30 00:56:52,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:52,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823866137] [2020-11-30 00:56:52,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:52,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823866137] [2020-11-30 00:56:52,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153286184] [2020-11-30 00:56:52,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:56:52,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-30 00:56:52,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:56:52,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:56:52,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:52,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:56:52,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-30 00:56:52,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812619535] [2020-11-30 00:56:52,909 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:56:52,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:52,911 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2020-11-30 00:56:52,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:52,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910431583] [2020-11-30 00:56:52,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:52,924 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:52,939 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:52,941 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:53,055 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-11-30 00:56:53,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:53,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:56:53,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:56:53,096 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-11-30 00:56:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:53,142 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-11-30 00:56:53,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:56:53,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-11-30 00:56:53,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:53,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2020-11-30 00:56:53,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 00:56:53,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 00:56:53,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2020-11-30 00:56:53,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:56:53,148 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-11-30 00:56:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2020-11-30 00:56:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-11-30 00:56:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-30 00:56:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-11-30 00:56:53,150 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-11-30 00:56:53,150 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-11-30 00:56:53,150 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 00:56:53,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2020-11-30 00:56:53,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:53,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:56:53,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:56:53,152 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2020-11-30 00:56:53,152 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:56:53,152 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 255#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 256#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 259#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 260#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 261#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 263#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 268#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 267#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 266#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 265#L13-3 assume !(main_~n~0 < 10); 258#L17-4 [2020-11-30 00:56:53,155 INFO L796 eck$LassoCheckResult]: Loop: 258#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 264#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 257#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 258#L17-4 [2020-11-30 00:56:53,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:53,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2020-11-30 00:56:53,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:53,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622760305] [2020-11-30 00:56:53,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:53,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622760305] [2020-11-30 00:56:53,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634161916] [2020-11-30 00:56:53,254 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:56:53,319 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 00:56:53,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:56:53,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 00:56:53,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:53,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:56:53,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-30 00:56:53,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614397368] [2020-11-30 00:56:53,353 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:56:53,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:53,354 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2020-11-30 00:56:53,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:53,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723688523] [2020-11-30 00:56:53,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:53,361 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:53,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:53,368 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:53,479 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-11-30 00:56:53,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:53,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:56:53,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:56:53,512 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2020-11-30 00:56:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:53,554 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-11-30 00:56:53,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:56:53,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2020-11-30 00:56:53,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:53,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2020-11-30 00:56:53,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 00:56:53,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 00:56:53,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-11-30 00:56:53,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:56:53,557 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-11-30 00:56:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-11-30 00:56:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-11-30 00:56:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-30 00:56:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-11-30 00:56:53,560 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-11-30 00:56:53,560 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-11-30 00:56:53,560 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-30 00:56:53,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2020-11-30 00:56:53,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:53,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:56:53,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:56:53,562 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2020-11-30 00:56:53,562 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:56:53,562 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 329#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 330#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 331#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 332#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 333#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 335#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 342#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 341#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 340#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 339#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 338#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 337#L13-3 assume !(main_~n~0 < 10); 328#L17-4 [2020-11-30 00:56:53,562 INFO L796 eck$LassoCheckResult]: Loop: 328#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 336#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 327#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 328#L17-4 [2020-11-30 00:56:53,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:53,563 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2020-11-30 00:56:53,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:53,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034912460] [2020-11-30 00:56:53,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:53,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034912460] [2020-11-30 00:56:53,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095682119] [2020-11-30 00:56:53,679 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:56:53,733 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-11-30 00:56:53,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:56:53,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:56:53,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:53,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:56:53,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-30 00:56:53,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365016777] [2020-11-30 00:56:53,781 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:56:53,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:53,782 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2020-11-30 00:56:53,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:53,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98344334] [2020-11-30 00:56:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:53,794 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:53,799 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:53,802 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:53,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:53,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:56:53,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:56:53,914 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2020-11-30 00:56:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:53,970 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-11-30 00:56:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:56:53,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2020-11-30 00:56:53,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:53,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2020-11-30 00:56:53,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 00:56:53,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 00:56:53,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2020-11-30 00:56:53,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:56:53,973 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-11-30 00:56:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2020-11-30 00:56:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-11-30 00:56:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-30 00:56:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-11-30 00:56:53,976 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-11-30 00:56:53,976 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-11-30 00:56:53,976 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-30 00:56:53,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-11-30 00:56:53,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:53,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:56:53,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:56:53,978 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2020-11-30 00:56:53,978 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:56:53,978 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 410#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 411#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 414#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 415#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 416#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 418#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 427#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 426#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 425#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 424#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 423#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 422#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 421#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 420#L13-3 assume !(main_~n~0 < 10); 413#L17-4 [2020-11-30 00:56:53,978 INFO L796 eck$LassoCheckResult]: Loop: 413#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 419#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 412#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 413#L17-4 [2020-11-30 00:56:53,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:53,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2020-11-30 00:56:53,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:53,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349174682] [2020-11-30 00:56:53,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:54,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349174682] [2020-11-30 00:56:54,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050433570] [2020-11-30 00:56:54,149 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:56:54,222 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-11-30 00:56:54,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:56:54,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:56:54,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:54,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:56:54,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-11-30 00:56:54,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324490012] [2020-11-30 00:56:54,268 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:56:54,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:54,275 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2020-11-30 00:56:54,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:54,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250462976] [2020-11-30 00:56:54,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:54,294 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:54,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:54,301 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:54,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:54,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:56:54,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:56:54,424 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2020-11-30 00:56:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:54,466 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-11-30 00:56:54,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:56:54,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-11-30 00:56:54,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:54,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2020-11-30 00:56:54,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 00:56:54,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 00:56:54,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2020-11-30 00:56:54,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:56:54,469 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-11-30 00:56:54,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2020-11-30 00:56:54,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-11-30 00:56:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-30 00:56:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-11-30 00:56:54,471 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-11-30 00:56:54,471 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-11-30 00:56:54,471 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-30 00:56:54,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2020-11-30 00:56:54,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:54,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:56:54,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:56:54,475 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2020-11-30 00:56:54,476 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:56:54,476 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 504#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 505#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 508#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 509#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 510#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 512#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 523#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 522#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 521#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 520#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 519#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 518#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 517#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 516#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 515#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 514#L13-3 assume !(main_~n~0 < 10); 507#L17-4 [2020-11-30 00:56:54,476 INFO L796 eck$LassoCheckResult]: Loop: 507#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 513#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 506#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 507#L17-4 [2020-11-30 00:56:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2020-11-30 00:56:54,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:54,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026551108] [2020-11-30 00:56:54,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:54,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026551108] [2020-11-30 00:56:54,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519730441] [2020-11-30 00:56:54,589 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:56:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:54,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 00:56:54,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:54,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:56:54,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-30 00:56:54,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844409569] [2020-11-30 00:56:54,668 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:56:54,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:54,669 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2020-11-30 00:56:54,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:54,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646417815] [2020-11-30 00:56:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:54,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:54,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:54,684 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:54,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:54,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:56:54,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:56:54,819 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2020-11-30 00:56:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:54,867 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-11-30 00:56:54,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:56:54,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2020-11-30 00:56:54,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:54,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2020-11-30 00:56:54,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 00:56:54,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 00:56:54,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2020-11-30 00:56:54,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:56:54,869 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-11-30 00:56:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2020-11-30 00:56:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-11-30 00:56:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-30 00:56:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-11-30 00:56:54,872 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-11-30 00:56:54,872 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-11-30 00:56:54,872 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-30 00:56:54,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-11-30 00:56:54,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:54,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:56:54,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:56:54,874 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2020-11-30 00:56:54,874 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:56:54,874 INFO L794 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 611#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 612#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 613#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 614#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 615#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 617#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 630#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 629#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 628#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 627#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 626#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 625#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 624#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 623#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 622#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 621#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 620#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 619#L13-3 assume !(main_~n~0 < 10); 610#L17-4 [2020-11-30 00:56:54,874 INFO L796 eck$LassoCheckResult]: Loop: 610#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 618#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 609#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 610#L17-4 [2020-11-30 00:56:54,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2020-11-30 00:56:54,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:54,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918368474] [2020-11-30 00:56:54,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:55,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918368474] [2020-11-30 00:56:55,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368627043] [2020-11-30 00:56:55,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:56:55,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:56:55,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:56:55,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 00:56:55,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:55,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:56:55,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-11-30 00:56:55,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664261769] [2020-11-30 00:56:55,134 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:56:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2020-11-30 00:56:55,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:55,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473981368] [2020-11-30 00:56:55,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:55,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:55,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:55,143 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:55,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:55,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 00:56:55,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:56:55,246 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2020-11-30 00:56:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:55,283 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-11-30 00:56:55,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 00:56:55,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2020-11-30 00:56:55,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:55,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2020-11-30 00:56:55,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 00:56:55,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 00:56:55,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2020-11-30 00:56:55,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:56:55,288 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-11-30 00:56:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2020-11-30 00:56:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-11-30 00:56:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-30 00:56:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-11-30 00:56:55,290 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-30 00:56:55,290 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-30 00:56:55,290 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-30 00:56:55,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2020-11-30 00:56:55,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:55,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:56:55,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:56:55,291 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2020-11-30 00:56:55,291 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:56:55,291 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 727#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 728#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 729#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 730#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 731#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 733#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 748#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 747#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 746#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 745#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 744#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 743#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 742#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 741#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 740#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 739#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 738#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 737#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 736#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 735#L13-3 assume !(main_~n~0 < 10); 726#L17-4 [2020-11-30 00:56:55,291 INFO L796 eck$LassoCheckResult]: Loop: 726#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 734#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 725#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 726#L17-4 [2020-11-30 00:56:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2020-11-30 00:56:55,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:55,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683310441] [2020-11-30 00:56:55,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:56:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:55,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683310441] [2020-11-30 00:56:55,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086113289] [2020-11-30 00:56:55,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:56:55,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-11-30 00:56:55,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:56:55,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 00:56:55,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:56:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:56:55,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:56:55,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-11-30 00:56:55,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063492910] [2020-11-30 00:56:55,565 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:56:55,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:55,565 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2020-11-30 00:56:55,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:55,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715080805] [2020-11-30 00:56:55,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:55,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:55,582 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:55,585 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:55,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:56:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 00:56:55,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-11-30 00:56:55,708 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2020-11-30 00:56:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:56:55,766 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-11-30 00:56:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 00:56:55,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-11-30 00:56:55,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:55,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2020-11-30 00:56:55,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 00:56:55,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-11-30 00:56:55,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2020-11-30 00:56:55,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:56:55,769 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-30 00:56:55,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2020-11-30 00:56:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-11-30 00:56:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-30 00:56:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-11-30 00:56:55,771 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-30 00:56:55,771 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-30 00:56:55,771 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-30 00:56:55,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2020-11-30 00:56:55,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:56:55,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:56:55,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:56:55,773 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2020-11-30 00:56:55,773 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:56:55,774 INFO L794 eck$LassoCheckResult]: Stem: 858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 853#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 854#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 855#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 856#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 857#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 859#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 876#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 875#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 874#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 873#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 872#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 871#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 870#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 869#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 868#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 867#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 866#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 865#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 864#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 863#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 862#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 861#L13-3 assume !(main_~n~0 < 10); 852#L17-4 [2020-11-30 00:56:55,774 INFO L796 eck$LassoCheckResult]: Loop: 852#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 860#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 851#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 852#L17-4 [2020-11-30 00:56:55,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:55,774 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2020-11-30 00:56:55,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:55,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322236076] [2020-11-30 00:56:55,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:55,787 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:55,800 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:55,806 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2020-11-30 00:56:55,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:55,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229499840] [2020-11-30 00:56:55,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:55,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:55,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:55,815 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:56:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:56:55,816 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2020-11-30 00:56:55,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:56:55,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148533971] [2020-11-30 00:56:55,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:56:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:55,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:56:55,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:56:55,889 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:57:00,727 WARN L193 SmtUtils]: Spent 4.71 s on a formula simplification. DAG size of input: 212 DAG size of output: 146 [2020-11-30 00:57:00,917 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-11-30 00:57:00,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 30.11 12:57:00 BoogieIcfgContainer [2020-11-30 00:57:00,961 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-30 00:57:00,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:57:00,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:57:00,962 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:57:00,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:56:49" (3/4) ... [2020-11-30 00:57:00,966 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-30 00:57:01,015 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f9b8c241-c184-4146-8ef5-917e01614930/bin/uautomizer/witness.graphml [2020-11-30 00:57:01,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:57:01,017 INFO L168 Benchmark]: Toolchain (without parser) took 12585.76 ms. Allocated memory was 94.4 MB in the beginning and 136.3 MB in the end (delta: 41.9 MB). Free memory was 64.8 MB in the beginning and 39.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 66.9 MB. Max. memory is 16.1 GB. [2020-11-30 00:57:01,018 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 75.5 MB. Free memory was 37.6 MB in the beginning and 37.6 MB in the end (delta: 36.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:57:01,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.85 ms. Allocated memory is still 94.4 MB. Free memory was 64.5 MB in the beginning and 72.8 MB in the end (delta: -8.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:57:01,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.81 ms. Allocated memory is still 94.4 MB. Free memory was 72.8 MB in the beginning and 71.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:57:01,020 INFO L168 Benchmark]: Boogie Preprocessor took 29.94 ms. Allocated memory is still 94.4 MB. Free memory was 71.3 MB in the beginning and 70.3 MB in the end (delta: 951.2 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:57:01,021 INFO L168 Benchmark]: RCFGBuilder took 392.90 ms. Allocated memory is still 94.4 MB. Free memory was 70.3 MB in the beginning and 59.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:57:01,021 INFO L168 Benchmark]: BuchiAutomizer took 11730.18 ms. Allocated memory was 94.4 MB in the beginning and 136.3 MB in the end (delta: 41.9 MB). Free memory was 59.5 MB in the beginning and 41.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 67.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:57:01,022 INFO L168 Benchmark]: Witness Printer took 54.36 ms. Allocated memory is still 136.3 MB. Free memory was 41.7 MB in the beginning and 39.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:57:01,026 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 75.5 MB. Free memory was 37.6 MB in the beginning and 37.6 MB in the end (delta: 36.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 321.85 ms. Allocated memory is still 94.4 MB. Free memory was 64.5 MB in the beginning and 72.8 MB in the end (delta: -8.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.81 ms. Allocated memory is still 94.4 MB. Free memory was 72.8 MB in the beginning and 71.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.94 ms. Allocated memory is still 94.4 MB. Free memory was 71.3 MB in the beginning and 70.3 MB in the end (delta: 951.2 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 392.90 ms. Allocated memory is still 94.4 MB. Free memory was 70.3 MB in the beginning and 59.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 11730.18 ms. Allocated memory was 94.4 MB in the beginning and 136.3 MB in the end (delta: 41.9 MB). Free memory was 59.5 MB in the beginning and 41.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 67.8 MB. Max. memory is 16.1 GB. * Witness Printer took 54.36 ms. Allocated memory is still 136.3 MB. Free memory was 41.7 MB in the beginning and 39.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (10 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * n + 19 and consists of 5 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.6s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 10.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 65 SDslu, 251 SDs, 0 SdLazy, 188 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital88 mio100 ax100 hnf100 lsp93 ukn59 mio100 lsp69 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@5530a8ff=0, NULL=0, \result=0, NULL=1, n=10, i=8, a=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9a61d84=8, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@57eb8da5=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@507be5af=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@204a9dd3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@4597dfd1=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...