./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i --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_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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 ace4aef293e19a259ba259e8c5434d0ef43394b5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 23:13:51,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 23:13:51,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 23:13:52,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 23:13:52,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 23:13:52,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 23:13:52,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 23:13:52,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 23:13:52,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 23:13:52,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 23:13:52,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 23:13:52,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 23:13:52,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 23:13:52,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 23:13:52,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 23:13:52,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 23:13:52,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 23:13:52,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 23:13:52,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 23:13:52,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 23:13:52,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 23:13:52,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 23:13:52,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 23:13:52,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 23:13:52,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 23:13:52,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 23:13:52,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 23:13:52,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 23:13:52,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 23:13:52,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 23:13:52,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 23:13:52,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 23:13:52,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 23:13:52,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 23:13:52,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 23:13:52,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 23:13:52,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 23:13:52,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 23:13:52,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 23:13:52,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 23:13:52,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 23:13:52,126 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-11-29 23:13:52,155 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 23:13:52,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 23:13:52,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 23:13:52,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 23:13:52,157 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 23:13:52,157 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 23:13:52,157 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 23:13:52,157 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 23:13:52,158 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 23:13:52,158 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 23:13:52,158 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 23:13:52,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 23:13:52,159 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 23:13:52,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 23:13:52,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 23:13:52,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 23:13:52,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 23:13:52,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 23:13:52,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 23:13:52,160 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 23:13:52,160 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 23:13:52,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 23:13:52,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 23:13:52,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 23:13:52,161 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 23:13:52,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 23:13:52,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 23:13:52,162 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 23:13:52,162 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 23:13:52,163 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 23:13:52,164 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_08227450-e03d-4262-a48d-d61024284dff/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_08227450-e03d-4262-a48d-d61024284dff/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 -> ace4aef293e19a259ba259e8c5434d0ef43394b5 [2020-11-29 23:13:52,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 23:13:52,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 23:13:52,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 23:13:52,451 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 23:13:52,452 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 23:13:52,453 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2020-11-29 23:13:52,537 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/data/8f7959c00/ba54cdf902114cbf85bf91c902284b03/FLAGf51f93557 [2020-11-29 23:13:53,111 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 23:13:53,112 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2020-11-29 23:13:53,138 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/data/8f7959c00/ba54cdf902114cbf85bf91c902284b03/FLAGf51f93557 [2020-11-29 23:13:53,393 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/data/8f7959c00/ba54cdf902114cbf85bf91c902284b03 [2020-11-29 23:13:53,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 23:13:53,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 23:13:53,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 23:13:53,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 23:13:53,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 23:13:53,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:13:53" (1/1) ... [2020-11-29 23:13:53,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272d24dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:13:53, skipping insertion in model container [2020-11-29 23:13:53,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:13:53" (1/1) ... [2020-11-29 23:13:53,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 23:13:53,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 23:13:53,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:13:53,728 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 23:13:53,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:13:53,805 INFO L208 MainTranslator]: Completed translation [2020-11-29 23:13:53,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:13:53 WrapperNode [2020-11-29 23:13:53,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 23:13:53,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 23:13:53,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 23:13:53,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 23:13:53,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:13:53" (1/1) ... [2020-11-29 23:13:53,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:13:53" (1/1) ... [2020-11-29 23:13:53,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 23:13:53,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 23:13:53,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 23:13:53,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 23:13:53,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:13:53" (1/1) ... [2020-11-29 23:13:53,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:13:53" (1/1) ... [2020-11-29 23:13:53,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:13:53" (1/1) ... [2020-11-29 23:13:53,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:13:53" (1/1) ... [2020-11-29 23:13:53,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:13:53" (1/1) ... [2020-11-29 23:13:53,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:13:53" (1/1) ... [2020-11-29 23:13:53,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:13:53" (1/1) ... [2020-11-29 23:13:53,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 23:13:53,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 23:13:53,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 23:13:53,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 23:13:53,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:13:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:13:53,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 23:13:53,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 23:13:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 23:13:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 23:13:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 23:13:53,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 23:13:54,195 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 23:13:54,198 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-11-29 23:13:54,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:13:54 BoogieIcfgContainer [2020-11-29 23:13:54,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 23:13:54,201 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 23:13:54,201 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 23:13:54,209 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 23:13:54,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 23:13:54,221 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 11:13:53" (1/3) ... [2020-11-29 23:13:54,222 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1137885c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 11:13:54, skipping insertion in model container [2020-11-29 23:13:54,223 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 23:13:54,223 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:13:53" (2/3) ... [2020-11-29 23:13:54,223 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1137885c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 11:13:54, skipping insertion in model container [2020-11-29 23:13:54,223 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 23:13:54,224 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:13:54" (3/3) ... [2020-11-29 23:13:54,229 INFO L373 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2020-11-29 23:13:54,307 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 23:13:54,307 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 23:13:54,307 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 23:13:54,314 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 23:13:54,315 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 23:13:54,315 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 23:13:54,315 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 23:13:54,315 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 23:13:54,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-11-29 23:13:54,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:13:54,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:13:54,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:13:54,352 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 23:13:54,352 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 23:13:54,352 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 23:13:54,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-11-29 23:13:54,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:13:54,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:13:54,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:13:54,354 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 23:13:54,354 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 23:13:54,361 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 11#L552-3true [2020-11-29 23:13:54,362 INFO L796 eck$LassoCheckResult]: Loop: 11#L552-3true goto; 5#L554-1true call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 8#L552-1true assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 12#L554true assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 11#L552-3true [2020-11-29 23:13:54,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:54,368 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-29 23:13:54,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:54,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333414] [2020-11-29 23:13:54,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:54,487 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:54,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:54,528 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:13:54,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:54,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2020-11-29 23:13:54,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:54,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804196736] [2020-11-29 23:13:54,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:54,547 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:54,559 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:54,563 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:13:54,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2020-11-29 23:13:54,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:54,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197580301] [2020-11-29 23:13:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:13:54,723 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-29 23:13:54,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197580301] [2020-11-29 23:13:54,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:13:54,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:13:54,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041253293] [2020-11-29 23:13:54,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:13:54,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:13:54,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:13:54,920 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 4 states. [2020-11-29 23:13:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:13:54,963 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-11-29 23:13:54,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 23:13:54,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2020-11-29 23:13:54,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:13:54,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 10 states and 11 transitions. [2020-11-29 23:13:54,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-29 23:13:54,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-29 23:13:54,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2020-11-29 23:13:54,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 23:13:54,976 INFO L691 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-11-29 23:13:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2020-11-29 23:13:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-11-29 23:13:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-11-29 23:13:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-11-29 23:13:55,018 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-11-29 23:13:55,018 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-11-29 23:13:55,018 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 23:13:55,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2020-11-29 23:13:55,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:13:55,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:13:55,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:13:55,021 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-29 23:13:55,021 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 23:13:55,021 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 40#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 41#L552-3 goto; 42#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 43#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 45#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 46#L554-1 [2020-11-29 23:13:55,022 INFO L796 eck$LassoCheckResult]: Loop: 46#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 49#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 47#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 46#L554-1 [2020-11-29 23:13:55,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:55,024 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2020-11-29 23:13:55,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:55,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600489059] [2020-11-29 23:13:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:55,064 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:55,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:55,116 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:13:55,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2020-11-29 23:13:55,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:55,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868026613] [2020-11-29 23:13:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:55,127 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:55,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:55,151 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:13:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2020-11-29 23:13:55,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:55,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277872073] [2020-11-29 23:13:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:55,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:55,190 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:55,194 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:13:55,328 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2020-11-29 23:13:55,583 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2020-11-29 23:13:55,695 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 23:13:55,696 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 23:13:55,696 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 23:13:55,696 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 23:13:55,697 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 23:13:55,697 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:13:55,698 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 23:13:55,699 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 23:13:55,699 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2020-11-29 23:13:55,699 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 23:13:55,699 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 23:13:55,726 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-29 23:13:55,734 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-29 23:13:55,738 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-29 23:13:55,744 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-29 23:13:55,750 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-29 23:13:55,754 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-29 23:13:55,758 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-29 23:13:55,764 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-29 23:13:55,773 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-29 23:13:55,779 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-29 23:13:55,784 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-29 23:13:55,957 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2020-11-29 23:13:55,987 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-29 23:13:55,990 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-29 23:13:55,995 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-29 23:13:56,367 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 23:13:56,371 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:13:56,386 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-29 23:13:56,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:13:56,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 23:13:56,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:13:56,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:13:56,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:13:56,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 23:13:56,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 23:13:56,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:13:56,444 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 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:13:56,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:13:56,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 23:13:56,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:13:56,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:13:56,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:13:56,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 23:13:56,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 23:13:56,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:13:56,477 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-29 23:13:56,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:13:56,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 23:13:56,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:13:56,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:13:56,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:13:56,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 23:13:56,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 23:13:56,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:13:56,512 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-29 23:13:56,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:13:56,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:13:56,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:13:56,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:13:56,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:13:56,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 23:13:56,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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) [2020-11-29 23:13:56,586 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-29 23:13:56,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:13:56,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:13:56,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:13:56,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:13:56,599 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:13:56,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:13:56,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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) [2020-11-29 23:13:56,659 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-29 23:13:56,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:13:56,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 23:13:56,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:13:56,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:13:56,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:13:56,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 23:13:56,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:13:56,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:13:56,705 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-29 23:13:56,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:13:56,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 23:13:56,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:13:56,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:13:56,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:13:56,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 23:13:56,709 INFO L402 nArgumentSynthesizer]: A total of 0 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-29 23:13:56,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:13:56,754 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-29 23:13:56,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:13:56,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:13:56,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:13:56,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:13:56,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:13:56,767 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-29 23:13:56,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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) [2020-11-29 23:13:56,815 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-29 23:13:56,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:13:56,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 23:13:56,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:13:56,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:13:56,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:13:56,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 23:13:56,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:13:56,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:13:56,846 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-29 23:13:56,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:13:56,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:13:56,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:13:56,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:13:56,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:13:56,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 23:13:56,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:13:56,880 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-29 23:13:56,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:13:56,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:13:56,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:13:56,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:13:56,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:13:56,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 23:13:56,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:13:56,922 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-29 23:13:56,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:13:56,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:13:56,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:13:56,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:13:56,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:13:56,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 23:13:56,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:13:56,980 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-29 23:13:56,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:13:56,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:13:56,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:13:56,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:13:56,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:13:56,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 23:13:56,995 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 23:13:57,078 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-11-29 23:13:57,078 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 23:13:57,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:13:57,129 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 23:13:57,130 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 23:13:57,130 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 + 19 Supporting invariants [] [2020-11-29 23:13:57,202 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2020-11-29 23:13:57,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-29 23:13:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:13:57,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 23:13:57,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:13:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:13:57,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 23:13:57,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:13:57,315 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2020-11-29 23:13:57,318 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:57,328 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:57,328 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:13:57,328 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2020-11-29 23:13:57,341 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-29 23:13:57,344 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-29 23:13:57,345 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-11-29 23:13:57,399 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 17 states and 20 transitions. Complement of second has 6 states. [2020-11-29 23:13:57,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-29 23:13:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-11-29 23:13:57,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-11-29 23:13:57,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2020-11-29 23:13:57,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 23:13:57,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2020-11-29 23:13:57,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 23:13:57,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2020-11-29 23:13:57,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 23:13:57,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2020-11-29 23:13:57,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:13:57,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2020-11-29 23:13:57,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 23:13:57,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-11-29 23:13:57,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2020-11-29 23:13:57,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 23:13:57,410 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-11-29 23:13:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2020-11-29 23:13:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-11-29 23:13:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-29 23:13:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-11-29 23:13:57,413 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-11-29 23:13:57,413 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-11-29 23:13:57,413 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 23:13:57,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-11-29 23:13:57,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:13:57,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:13:57,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:13:57,416 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-11-29 23:13:57,416 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 23:13:57,416 INFO L794 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 149#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 150#L552-3 goto; 164#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 163#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 162#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 161#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 152#L552-1 [2020-11-29 23:13:57,416 INFO L796 eck$LassoCheckResult]: Loop: 152#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 156#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 158#L552-3 goto; 151#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 152#L552-1 [2020-11-29 23:13:57,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2020-11-29 23:13:57,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:57,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147342913] [2020-11-29 23:13:57,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:57,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:57,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:57,462 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:13:57,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:57,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2020-11-29 23:13:57,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:57,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777370251] [2020-11-29 23:13:57,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:57,484 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:57,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:57,492 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:13:57,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:57,493 INFO L82 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2020-11-29 23:13:57,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:57,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838529104] [2020-11-29 23:13:57,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:13:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:13:57,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838529104] [2020-11-29 23:13:57,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279457996] [2020-11-29 23:13:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:13:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:13:57,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 23:13:57,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:13:57,703 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-29 23:13:57,708 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:57,715 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:57,723 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 23:13:57,723 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:57,732 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:57,735 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:13:57,735 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-11-29 23:13:57,820 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:13:57,821 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:57,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:57,831 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:13:57,831 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:13:57,919 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-11-29 23:13:57,920 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:57,925 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:57,929 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:13:57,929 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-11-29 23:13:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:13:57,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:13:57,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-11-29 23:13:57,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489440853] [2020-11-29 23:13:58,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:13:58,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 23:13:58,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-29 23:13:58,035 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2020-11-29 23:13:58,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:13:58,099 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-11-29 23:13:58,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 23:13:58,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2020-11-29 23:13:58,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:13:58,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 20 transitions. [2020-11-29 23:13:58,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 23:13:58,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 23:13:58,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2020-11-29 23:13:58,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 23:13:58,102 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-11-29 23:13:58,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2020-11-29 23:13:58,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-11-29 23:13:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-29 23:13:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-11-29 23:13:58,105 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-11-29 23:13:58,105 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-11-29 23:13:58,105 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 23:13:58,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-11-29 23:13:58,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:13:58,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:13:58,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:13:58,106 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2020-11-29 23:13:58,106 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 23:13:58,106 INFO L794 eck$LassoCheckResult]: Stem: 235#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 229#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 230#L552-3 goto; 246#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 236#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 237#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 245#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 244#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 242#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 243#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 232#L552-1 [2020-11-29 23:13:58,107 INFO L796 eck$LassoCheckResult]: Loop: 232#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 241#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 239#L552-3 goto; 231#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 232#L552-1 [2020-11-29 23:13:58,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:58,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1269751228, now seen corresponding path program 4 times [2020-11-29 23:13:58,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:58,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226263366] [2020-11-29 23:13:58,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:58,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:58,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:58,148 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:13:58,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:58,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2020-11-29 23:13:58,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:58,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368604962] [2020-11-29 23:13:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:58,166 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:58,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:58,173 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:13:58,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash 112465226, now seen corresponding path program 2 times [2020-11-29 23:13:58,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:58,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091773529] [2020-11-29 23:13:58,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:13:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:13:58,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091773529] [2020-11-29 23:13:58,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180533570] [2020-11-29 23:13:58,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:13:58,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 23:13:58,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 23:13:58,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 23:13:58,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:13:58,334 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-29 23:13:58,338 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:58,345 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:58,351 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 23:13:58,351 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:58,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:58,360 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:13:58,361 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-11-29 23:13:58,407 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:13:58,408 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:58,419 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:58,420 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:13:58,420 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:13:58,471 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:13:58,472 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:58,480 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:58,482 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:13:58,482 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:13:58,535 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-11-29 23:13:58,537 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:58,543 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:58,544 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:13:58,545 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-11-29 23:13:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:13:58,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:13:58,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-11-29 23:13:58,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527244425] [2020-11-29 23:13:58,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:13:58,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 23:13:58,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:13:58,642 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 9 states. [2020-11-29 23:13:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:13:58,781 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-11-29 23:13:58,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 23:13:58,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2020-11-29 23:13:58,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:13:58,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 23 transitions. [2020-11-29 23:13:58,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 23:13:58,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 23:13:58,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2020-11-29 23:13:58,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 23:13:58,785 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-11-29 23:13:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2020-11-29 23:13:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-11-29 23:13:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-29 23:13:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-11-29 23:13:58,787 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-11-29 23:13:58,787 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-11-29 23:13:58,787 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 23:13:58,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2020-11-29 23:13:58,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:13:58,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:13:58,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:13:58,789 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1] [2020-11-29 23:13:58,789 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 23:13:58,789 INFO L794 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 327#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 328#L552-3 goto; 347#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 346#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 345#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 329#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 330#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 336#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 331#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 332#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 344#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 342#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 334#L552-1 [2020-11-29 23:13:58,789 INFO L796 eck$LassoCheckResult]: Loop: 334#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 335#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 337#L552-3 goto; 338#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 334#L552-1 [2020-11-29 23:13:58,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:58,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1381845472, now seen corresponding path program 5 times [2020-11-29 23:13:58,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:58,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640854218] [2020-11-29 23:13:58,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:58,804 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:58,820 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:58,825 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:13:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:58,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2020-11-29 23:13:58,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:58,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543805779] [2020-11-29 23:13:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:58,834 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:13:58,838 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:13:58,840 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:13:58,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:13:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash 320887590, now seen corresponding path program 3 times [2020-11-29 23:13:58,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:13:58,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597791664] [2020-11-29 23:13:58,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:13:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:13:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:13:58,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597791664] [2020-11-29 23:13:58,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98332284] [2020-11-29 23:13:58,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:13:59,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-29 23:13:59,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 23:13:59,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-29 23:13:59,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:13:59,071 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-11-29 23:13:59,072 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 23:13:59,072 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:59,081 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:59,082 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 23:13:59,082 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2020-11-29 23:13:59,152 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:59,153 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 61 [2020-11-29 23:13:59,155 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:59,195 INFO L625 ElimStorePlain]: treesize reduction 38, result has 42.4 percent of original size [2020-11-29 23:13:59,198 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 23:13:59,198 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:24 [2020-11-29 23:13:59,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:13:59,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:13:59,308 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:59,308 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 61 [2020-11-29 23:13:59,309 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:59,319 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 23:13:59,320 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:59,372 INFO L625 ElimStorePlain]: treesize reduction 49, result has 41.0 percent of original size [2020-11-29 23:13:59,373 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-11-29 23:13:59,373 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:34 [2020-11-29 23:13:59,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:13:59,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 23:13:59,433 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 23:13:59,434 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:59,474 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:59,475 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 61 [2020-11-29 23:13:59,476 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:59,517 INFO L625 ElimStorePlain]: treesize reduction 46, result has 41.0 percent of original size [2020-11-29 23:13:59,518 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-11-29 23:13:59,518 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:32 [2020-11-29 23:13:59,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:13:59,579 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-11-29 23:13:59,580 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:59,594 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:13:59,594 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2020-11-29 23:13:59,595 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:13:59,628 INFO L625 ElimStorePlain]: treesize reduction 17, result has 29.2 percent of original size [2020-11-29 23:13:59,629 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:13:59,629 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:7 [2020-11-29 23:13:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:13:59,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:13:59,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-11-29 23:13:59,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512561654] [2020-11-29 23:13:59,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:13:59,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 23:13:59,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:13:59,784 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 12 states. [2020-11-29 23:14:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:14:00,043 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-11-29 23:14:00,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 23:14:00,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-11-29 23:14:00,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:00,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 26 transitions. [2020-11-29 23:14:00,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 23:14:00,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 23:14:00,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2020-11-29 23:14:00,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 23:14:00,047 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-29 23:14:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2020-11-29 23:14:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-11-29 23:14:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-29 23:14:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-11-29 23:14:00,049 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-29 23:14:00,049 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-29 23:14:00,049 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 23:14:00,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2020-11-29 23:14:00,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:00,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:14:00,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:14:00,051 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2020-11-29 23:14:00,051 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 23:14:00,051 INFO L794 eck$LassoCheckResult]: Stem: 451#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 445#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 446#L552-3 goto; 467#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 466#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 464#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 447#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 448#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 468#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 449#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 450#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 454#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 463#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 465#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 459#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 460#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 452#L552-1 [2020-11-29 23:14:00,051 INFO L796 eck$LassoCheckResult]: Loop: 452#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 453#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 455#L552-3 goto; 456#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 452#L552-1 [2020-11-29 23:14:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:00,052 INFO L82 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 6 times [2020-11-29 23:14:00,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:00,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833303337] [2020-11-29 23:14:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:00,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:00,108 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:00,117 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:00,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 5 times [2020-11-29 23:14:00,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:00,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193111252] [2020-11-29 23:14:00,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:00,132 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:00,136 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:00,138 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:00,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:00,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 4 times [2020-11-29 23:14:00,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:00,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818024517] [2020-11-29 23:14:00,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:00,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818024517] [2020-11-29 23:14:00,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283252093] [2020-11-29 23:14:00,238 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:14:00,301 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 23:14:00,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 23:14:00,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-29 23:14:00,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:14:00,313 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 23:14:00,322 INFO L350 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2020-11-29 23:14:00,323 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 23:14:00,323 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:00,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:00,338 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:00,338 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:27 [2020-11-29 23:14:00,368 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 23:14:00,368 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:00,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:00,376 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:00,376 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2020-11-29 23:14:00,397 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 23:14:00,397 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:00,403 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:00,403 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:00,403 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2020-11-29 23:14:00,432 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 23:14:00,433 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:00,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:00,439 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:00,439 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2020-11-29 23:14:00,462 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 23:14:00,463 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:00,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:00,469 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:00,469 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:14 [2020-11-29 23:14:00,510 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-11-29 23:14:00,510 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:00,537 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:00,540 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:00,540 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2020-11-29 23:14:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:00,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:14:00,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-11-29 23:14:00,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373714560] [2020-11-29 23:14:00,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:14:00,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 23:14:00,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-29 23:14:00,627 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2020-11-29 23:14:00,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:14:00,800 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-11-29 23:14:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 23:14:00,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2020-11-29 23:14:00,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:00,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 29 transitions. [2020-11-29 23:14:00,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 23:14:00,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 23:14:00,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2020-11-29 23:14:00,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 23:14:00,803 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-11-29 23:14:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2020-11-29 23:14:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-11-29 23:14:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-29 23:14:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-11-29 23:14:00,805 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-11-29 23:14:00,805 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-11-29 23:14:00,805 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 23:14:00,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2020-11-29 23:14:00,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:00,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:14:00,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:14:00,807 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1] [2020-11-29 23:14:00,807 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 23:14:00,807 INFO L794 eck$LassoCheckResult]: Stem: 587#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 581#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 582#L552-3 goto; 591#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 599#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 606#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 583#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 584#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 595#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 585#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 586#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 590#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 605#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 604#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 603#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 602#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 601#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 600#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 597#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 588#L552-1 [2020-11-29 23:14:00,807 INFO L796 eck$LassoCheckResult]: Loop: 588#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 589#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 594#L552-3 goto; 607#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 588#L552-1 [2020-11-29 23:14:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash -866483296, now seen corresponding path program 7 times [2020-11-29 23:14:00,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:00,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573233525] [2020-11-29 23:14:00,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:00,821 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:00,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:00,839 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:00,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:00,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 6 times [2020-11-29 23:14:00,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:00,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685125454] [2020-11-29 23:14:00,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:00,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:00,857 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:00,862 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:00,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:00,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1312123046, now seen corresponding path program 5 times [2020-11-29 23:14:00,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:00,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599502974] [2020-11-29 23:14:00,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:00,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599502974] [2020-11-29 23:14:00,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156216124] [2020-11-29 23:14:00,979 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:14:01,060 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2020-11-29 23:14:01,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 23:14:01,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 23:14:01,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:14:01,077 INFO L350 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2020-11-29 23:14:01,077 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 23:14:01,078 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,083 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:01,084 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:01,084 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2020-11-29 23:14:01,105 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 23:14:01,105 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:01,115 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,115 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2020-11-29 23:14:01,129 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 23:14:01,129 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:01,135 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,135 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2020-11-29 23:14:01,153 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 23:14:01,154 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:01,159 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,160 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2020-11-29 23:14:01,179 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 23:14:01,180 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,185 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:01,186 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,186 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2020-11-29 23:14:01,207 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 23:14:01,207 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:01,214 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,214 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2020-11-29 23:14:01,238 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-11-29 23:14:01,238 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:01,243 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,244 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2020-11-29 23:14:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:01,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:14:01,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-11-29 23:14:01,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183176220] [2020-11-29 23:14:01,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:14:01,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 23:14:01,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-11-29 23:14:01,344 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 4 Second operand 15 states. [2020-11-29 23:14:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:14:01,575 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-11-29 23:14:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 23:14:01,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2020-11-29 23:14:01,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:01,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 32 transitions. [2020-11-29 23:14:01,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 23:14:01,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 23:14:01,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2020-11-29 23:14:01,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 23:14:01,578 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-11-29 23:14:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2020-11-29 23:14:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-11-29 23:14:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-29 23:14:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-11-29 23:14:01,580 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-11-29 23:14:01,580 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-11-29 23:14:01,580 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 23:14:01,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2020-11-29 23:14:01,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:01,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:14:01,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:14:01,582 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1] [2020-11-29 23:14:01,582 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 23:14:01,582 INFO L794 eck$LassoCheckResult]: Stem: 742#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 736#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 737#L552-3 goto; 746#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 753#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 754#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 738#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 739#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 745#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 740#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 741#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 765#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 764#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 763#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 762#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 761#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 760#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 759#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 758#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 756#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 755#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 751#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 743#L552-1 [2020-11-29 23:14:01,582 INFO L796 eck$LassoCheckResult]: Loop: 743#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 744#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 749#L552-3 goto; 757#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 743#L552-1 [2020-11-29 23:14:01,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:01,583 INFO L82 PathProgramCache]: Analyzing trace with hash -650410172, now seen corresponding path program 8 times [2020-11-29 23:14:01,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:01,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147726795] [2020-11-29 23:14:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:01,604 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:01,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:01,626 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:01,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:01,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 7 times [2020-11-29 23:14:01,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:01,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547194913] [2020-11-29 23:14:01,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:01,632 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:01,636 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:01,638 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:01,639 INFO L82 PathProgramCache]: Analyzing trace with hash 904133194, now seen corresponding path program 6 times [2020-11-29 23:14:01,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:01,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35070781] [2020-11-29 23:14:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:01,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35070781] [2020-11-29 23:14:01,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944395799] [2020-11-29 23:14:01,797 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:14:01,906 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2020-11-29 23:14:01,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 23:14:01,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 23:14:01,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:14:01,938 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-29 23:14:01,946 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,961 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:01,967 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 23:14:01,967 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:01,982 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:01,984 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:01,984 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:02,044 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:02,045 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:02,060 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:02,062 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:02,062 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:02,112 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:02,112 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:02,126 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:02,127 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:02,127 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:02,178 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:02,178 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:02,187 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:02,188 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:02,188 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:02,227 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:02,228 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:02,236 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:02,238 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:02,238 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:02,283 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:02,283 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:02,301 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:02,302 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:02,303 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:02,372 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:02,373 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:02,388 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:02,389 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:02,390 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:02,441 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-11-29 23:14:02,442 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:02,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:02,447 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:02,447 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-11-29 23:14:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:02,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:14:02,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-11-29 23:14:02,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241959523] [2020-11-29 23:14:02,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:14:02,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-29 23:14:02,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-11-29 23:14:02,510 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 4 Second operand 17 states. [2020-11-29 23:14:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:14:02,815 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-11-29 23:14:02,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-29 23:14:02,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2020-11-29 23:14:02,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:02,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 35 transitions. [2020-11-29 23:14:02,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 23:14:02,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 23:14:02,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2020-11-29 23:14:02,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 23:14:02,819 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-11-29 23:14:02,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2020-11-29 23:14:02,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-11-29 23:14:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-11-29 23:14:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-11-29 23:14:02,822 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-11-29 23:14:02,823 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-11-29 23:14:02,823 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 23:14:02,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2020-11-29 23:14:02,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:02,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:14:02,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:14:02,825 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1] [2020-11-29 23:14:02,825 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 23:14:02,825 INFO L794 eck$LassoCheckResult]: Stem: 916#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 910#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 911#L552-3 goto; 920#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 927#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 928#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 912#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 913#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 919#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 914#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 915#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 942#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 941#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 940#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 939#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 938#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 937#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 936#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 935#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 934#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 933#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 932#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 930#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 929#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 925#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 917#L552-1 [2020-11-29 23:14:02,825 INFO L796 eck$LassoCheckResult]: Loop: 917#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 918#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 923#L552-3 goto; 931#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 917#L552-1 [2020-11-29 23:14:02,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:02,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1771949792, now seen corresponding path program 9 times [2020-11-29 23:14:02,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:02,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059888477] [2020-11-29 23:14:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:02,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:02,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:02,883 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:02,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 8 times [2020-11-29 23:14:02,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:02,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841960215] [2020-11-29 23:14:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:02,890 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:02,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:02,901 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:02,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1235899942, now seen corresponding path program 7 times [2020-11-29 23:14:02,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:02,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255537016] [2020-11-29 23:14:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:03,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255537016] [2020-11-29 23:14:03,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400323488] [2020-11-29 23:14:03,051 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:14:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:03,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-29 23:14:03,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:14:03,141 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-29 23:14:03,142 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:03,149 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:03,154 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 23:14:03,154 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:03,161 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:03,163 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:03,163 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:03,194 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:03,195 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:03,203 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:03,204 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:03,204 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:03,267 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:03,268 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:03,276 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:03,277 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:03,277 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:03,312 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:03,313 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:03,323 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:03,324 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:03,324 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:03,361 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:03,362 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:03,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:03,371 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:03,371 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:03,407 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:03,408 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:03,418 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:03,419 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:03,419 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:03,463 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:03,464 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:03,474 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:03,475 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:03,475 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:03,521 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:03,521 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:03,533 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:03,534 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:03,535 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:03,578 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-11-29 23:14:03,582 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:03,588 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:03,589 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:03,590 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-11-29 23:14:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:03,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:14:03,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2020-11-29 23:14:03,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207587936] [2020-11-29 23:14:03,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:14:03,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-29 23:14:03,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-11-29 23:14:03,666 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 4 Second operand 19 states. [2020-11-29 23:14:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:14:04,094 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-11-29 23:14:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 23:14:04,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2020-11-29 23:14:04,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:04,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 38 transitions. [2020-11-29 23:14:04,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 23:14:04,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 23:14:04,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2020-11-29 23:14:04,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 23:14:04,097 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-11-29 23:14:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2020-11-29 23:14:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-11-29 23:14:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-11-29 23:14:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-11-29 23:14:04,101 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-11-29 23:14:04,101 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-11-29 23:14:04,101 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 23:14:04,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2020-11-29 23:14:04,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:04,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:14:04,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:14:04,107 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1] [2020-11-29 23:14:04,107 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 23:14:04,107 INFO L794 eck$LassoCheckResult]: Stem: 1109#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1103#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1104#L552-3 goto; 1113#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1120#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1121#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1105#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1106#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1112#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1107#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1108#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1138#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1137#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1136#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1135#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1134#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1133#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1132#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1131#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1130#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1129#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1128#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1127#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1126#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1125#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1123#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1122#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1118#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1110#L552-1 [2020-11-29 23:14:04,107 INFO L796 eck$LassoCheckResult]: Loop: 1110#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1111#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 1116#L552-3 goto; 1124#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1110#L552-1 [2020-11-29 23:14:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:04,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1286793668, now seen corresponding path program 10 times [2020-11-29 23:14:04,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:04,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068958142] [2020-11-29 23:14:04,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:04,126 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:04,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:04,151 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:04,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:04,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 9 times [2020-11-29 23:14:04,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:04,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519478782] [2020-11-29 23:14:04,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:04,158 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:04,162 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:04,164 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2115625782, now seen corresponding path program 8 times [2020-11-29 23:14:04,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:04,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562468453] [2020-11-29 23:14:04,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:04,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562468453] [2020-11-29 23:14:04,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502199468] [2020-11-29 23:14:04,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/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-29 23:14:04,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 23:14:04,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 23:14:04,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 23:14:04,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:14:04,440 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-29 23:14:04,441 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:04,454 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:04,461 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 23:14:04,462 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:04,483 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:04,484 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:04,484 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:04,538 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:04,538 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:04,546 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:04,547 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:04,548 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:04,583 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:04,584 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:04,592 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:04,593 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:04,593 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:04,623 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:04,624 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:04,632 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:04,633 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:04,633 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:04,672 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:04,672 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:04,681 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:04,682 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:04,682 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:04,721 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:04,722 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:04,730 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:04,731 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:04,731 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:04,771 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:04,771 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:04,780 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:04,781 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:04,782 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:04,819 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:04,820 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:04,827 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:04,828 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:04,828 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:04,864 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:04,864 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:04,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:04,874 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:04,874 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:04,925 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-11-29 23:14:04,926 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:04,931 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:04,932 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:04,932 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-11-29 23:14:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:04,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:14:04,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-11-29 23:14:04,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14359757] [2020-11-29 23:14:05,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:14:05,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-29 23:14:05,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2020-11-29 23:14:05,005 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand 21 states. [2020-11-29 23:14:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:14:05,479 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-11-29 23:14:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-29 23:14:05,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2020-11-29 23:14:05,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:05,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 41 transitions. [2020-11-29 23:14:05,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 23:14:05,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 23:14:05,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2020-11-29 23:14:05,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 23:14:05,482 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-11-29 23:14:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2020-11-29 23:14:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-29 23:14:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-29 23:14:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-11-29 23:14:05,486 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-11-29 23:14:05,486 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-11-29 23:14:05,486 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-29 23:14:05,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2020-11-29 23:14:05,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:05,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:14:05,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:14:05,488 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1] [2020-11-29 23:14:05,489 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 23:14:05,489 INFO L794 eck$LassoCheckResult]: Stem: 1321#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1315#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1316#L552-3 goto; 1325#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1332#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1333#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1317#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1318#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1324#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1319#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1320#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1353#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1352#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1351#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1350#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1349#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1348#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1347#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1346#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1345#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1344#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1343#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1342#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1341#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1340#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1339#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1338#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1337#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1335#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1334#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1330#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1322#L552-1 [2020-11-29 23:14:05,489 INFO L796 eck$LassoCheckResult]: Loop: 1322#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1323#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 1328#L552-3 goto; 1336#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1322#L552-1 [2020-11-29 23:14:05,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:05,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2007908704, now seen corresponding path program 11 times [2020-11-29 23:14:05,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:05,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595711201] [2020-11-29 23:14:05,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:05,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:05,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:05,551 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:05,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:05,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 10 times [2020-11-29 23:14:05,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:05,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572665226] [2020-11-29 23:14:05,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:05,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:05,569 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:05,571 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:05,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:05,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1981227942, now seen corresponding path program 9 times [2020-11-29 23:14:05,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:05,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114658700] [2020-11-29 23:14:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:05,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114658700] [2020-11-29 23:14:05,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088473212] [2020-11-29 23:14:05,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:14:05,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2020-11-29 23:14:05,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 23:14:05,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-29 23:14:05,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:14:05,889 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-29 23:14:05,910 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:05,917 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:05,922 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 23:14:05,922 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:05,929 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:05,930 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:05,930 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:05,954 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:05,955 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:05,961 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:05,962 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:05,963 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:06,022 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:06,023 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:06,034 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:06,035 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:06,035 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:06,065 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:06,066 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:06,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:06,077 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:06,078 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:06,112 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:06,113 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:06,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:06,123 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:06,123 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:06,186 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:06,186 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:06,201 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:06,202 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:06,203 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:06,265 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:06,266 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:06,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:06,279 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:06,279 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:06,340 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:06,340 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:06,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:06,355 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:06,356 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:06,404 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:06,405 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:06,414 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:06,415 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:06,416 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:06,467 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:06,468 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:06,475 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:06,476 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:06,476 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:06,526 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-11-29 23:14:06,527 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:06,536 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:06,537 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:06,537 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-11-29 23:14:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:06,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:14:06,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2020-11-29 23:14:06,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049666185] [2020-11-29 23:14:06,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:14:06,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-29 23:14:06,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2020-11-29 23:14:06,609 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 4 Second operand 23 states. [2020-11-29 23:14:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:14:07,264 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-11-29 23:14:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-29 23:14:07,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2020-11-29 23:14:07,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:07,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 44 transitions. [2020-11-29 23:14:07,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-29 23:14:07,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 23:14:07,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2020-11-29 23:14:07,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 23:14:07,267 INFO L691 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-11-29 23:14:07,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2020-11-29 23:14:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-29 23:14:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-29 23:14:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-11-29 23:14:07,270 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-11-29 23:14:07,270 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-11-29 23:14:07,270 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-29 23:14:07,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2020-11-29 23:14:07,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:07,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:14:07,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:14:07,272 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2020-11-29 23:14:07,272 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 23:14:07,272 INFO L794 eck$LassoCheckResult]: Stem: 1552#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1546#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1547#L552-3 goto; 1556#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1563#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1564#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1548#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1549#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1555#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1550#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1551#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1587#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1586#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1585#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1584#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1583#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1582#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1581#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1580#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1579#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1578#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1577#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1576#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1575#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1574#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1573#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1572#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1571#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1570#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1569#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1568#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1566#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1565#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1561#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1553#L552-1 [2020-11-29 23:14:07,272 INFO L796 eck$LassoCheckResult]: Loop: 1553#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1554#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 1559#L552-3 goto; 1567#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1553#L552-1 [2020-11-29 23:14:07,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:07,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 12 times [2020-11-29 23:14:07,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:07,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4092595] [2020-11-29 23:14:07,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:07,290 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:07,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:07,311 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:07,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 11 times [2020-11-29 23:14:07,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:07,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460169292] [2020-11-29 23:14:07,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:07,316 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:07,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:07,320 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:07,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 10 times [2020-11-29 23:14:07,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:07,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016883889] [2020-11-29 23:14:07,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:07,338 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:07,354 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:07,360 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:18,822 WARN L193 SmtUtils]: Spent 11.38 s on a formula simplification. DAG size of input: 204 DAG size of output: 166 [2020-11-29 23:14:18,894 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 23:14:18,894 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 23:14:18,894 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 23:14:18,894 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 23:14:18,894 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 23:14:18,894 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:14:18,894 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 23:14:18,894 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 23:14:18,894 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration12_Lasso [2020-11-29 23:14:18,894 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 23:14:18,894 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 23:14:18,899 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-29 23:14:18,902 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-29 23:14:18,905 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-29 23:14:18,907 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-29 23:14:18,910 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-29 23:14:19,063 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-11-29 23:14:19,144 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-29 23:14:19,147 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-29 23:14:19,150 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-29 23:14:19,152 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-29 23:14:19,155 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-29 23:14:19,158 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-29 23:14:19,160 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-29 23:14:19,165 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-29 23:14:19,509 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 23:14:19,509 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:14:19,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 23:14:19,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:14:19,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 23:14:19,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:14:19,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:14:19,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:14:19,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 23:14:19,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 23:14:19,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:14:19,639 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-29 23:14:19,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:14:19,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 23:14:19,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:14:19,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:14:19,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:14:19,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 23:14:19,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 23:14:19,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:14:19,680 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-29 23:14:19,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:14:19,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 23:14:19,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:14:19,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:14:19,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:14:19,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 23:14:19,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 23:14:19,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 23:14:19,727 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-29 23:14:19,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:14:19,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:14:19,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:14:19,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:14:19,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:14:19,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:14:19,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 23:14:19,777 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-29 23:14:19,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:14:19,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:14:19,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:14:19,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:14:19,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:14:19,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:14:19,787 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 23:14:19,826 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-29 23:14:19,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:14:19,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:14:19,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:14:19,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:14:19,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:14:19,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 23:14:19,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:14:19,872 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-29 23:14:19,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:14:19,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:14:19,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:14:19,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:14:19,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:14:19,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 23:14:19,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:14:19,913 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-29 23:14:19,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:14:19,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:14:19,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:14:19,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:14:19,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:14:19,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 23:14:19,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:14:19,945 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-29 23:14:19,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:14:19,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:14:19,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:14:19,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:14:19,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:14:19,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 23:14:19,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:14:19,978 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-29 23:14:19,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:14:19,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:14:19,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:14:19,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:14:19,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:14:19,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 23:14:20,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:14:20,032 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-29 23:14:20,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:14:20,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:14:20,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:14:20,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:14:20,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 23:14:20,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 23:14:20,050 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 23:14:20,070 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-11-29 23:14:20,071 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:14:20,073 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 23:14:20,077 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-29 23:14:20,077 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 23:14:20,077 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem4) = -41*ULTIMATE.start_main_#t~mem4 + 790 Supporting invariants [-40*ULTIMATE.start_main_#t~mem4 + 41*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 >= 0] [2020-11-29 23:14:20,129 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2020-11-29 23:14:20,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:20,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-29 23:14:20,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:14:20,211 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-29 23:14:20,212 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:20,220 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:20,224 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 23:14:20,224 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:20,231 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:20,232 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:20,233 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:20,297 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:20,298 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:20,311 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:20,312 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:20,312 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:20,356 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:20,356 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:20,367 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:20,367 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:20,368 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:20,412 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:20,412 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:20,421 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:20,422 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:20,422 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:20,472 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:20,472 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:20,481 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:20,482 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:20,482 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:20,523 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:20,523 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:20,531 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:20,532 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:20,532 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:20,594 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:20,595 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:20,604 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:20,605 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:20,605 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:20,661 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:20,662 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:20,672 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:20,673 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:20,674 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:20,726 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:20,726 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:20,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:20,737 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:20,737 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:20,798 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:20,798 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:20,809 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:20,810 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:20,810 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:20,864 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:20,865 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:20,877 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:20,878 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:20,878 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:20,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 23:14:20,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:14:21,002 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2020-11-29 23:14:21,002 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:21,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:21,018 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:21,018 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2020-11-29 23:14:21,159 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:21,160 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 75 [2020-11-29 23:14:21,175 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-29 23:14:21,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:14:21,185 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-29 23:14:21,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:14:21,189 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:21,312 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-11-29 23:14:21,313 INFO L625 ElimStorePlain]: treesize reduction 20, result has 81.0 percent of original size [2020-11-29 23:14:21,317 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 23:14:21,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:14:21,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:14:21,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:14:21,327 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:21,328 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:85 [2020-11-29 23:14:21,331 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 23:14:21,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:14:21,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:14:21,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:14:22,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:14:22,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-11-29 23:14:22,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:14:22,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:14:34,505 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-29 23:14:34,505 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 4 loop predicates [2020-11-29 23:14:34,505 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 16 states. [2020-11-29 23:14:34,571 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 16 states. Result 43 states and 45 transitions. Complement of second has 6 states. [2020-11-29 23:14:34,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-29 23:14:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-29 23:14:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2020-11-29 23:14:34,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2020-11-29 23:14:34,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 23:14:34,573 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-29 23:14:34,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:34,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-29 23:14:34,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:14:34,656 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-29 23:14:34,657 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:34,665 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:34,668 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 23:14:34,668 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:34,676 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:34,676 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:34,677 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:34,733 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:34,734 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:34,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:34,744 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:34,744 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:34,774 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:34,775 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:34,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:34,784 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:34,784 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:34,832 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:34,833 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:34,851 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:34,852 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:34,853 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:34,900 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:34,900 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:34,911 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:34,912 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:34,912 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:34,965 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:34,966 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:34,977 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:34,979 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:34,979 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:35,029 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:35,030 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:35,039 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:35,040 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:35,041 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:35,101 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:35,102 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:35,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:35,115 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:35,115 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:35,177 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:35,178 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:35,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:35,193 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:35,193 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:35,256 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:35,257 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:35,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:35,270 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:35,270 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:35,355 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:35,356 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:35,366 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:35,367 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:35,367 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:35,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 23:14:35,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:14:35,436 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2020-11-29 23:14:35,436 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:35,447 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:35,449 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:35,449 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2020-11-29 23:14:35,542 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:35,542 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 75 [2020-11-29 23:14:35,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:14:35,551 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 23:14:35,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:14:35,559 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 23:14:35,568 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:35,641 INFO L625 ElimStorePlain]: treesize reduction 20, result has 81.0 percent of original size [2020-11-29 23:14:35,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:14:35,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-11-29 23:14:35,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:14:35,653 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:35,653 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:115 [2020-11-29 23:14:35,728 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-29 23:14:35,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2020-11-29 23:14:35,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2020-11-29 23:14:35,846 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 15 states. Result 43 states and 45 transitions. Complement of second has 6 states. [2020-11-29 23:14:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-29 23:14:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-29 23:14:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2020-11-29 23:14:35,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2020-11-29 23:14:35,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 23:14:35,849 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-29 23:14:35,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:35,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-29 23:14:35,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:14:35,953 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-29 23:14:35,958 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:35,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:35,977 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 23:14:35,977 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:35,985 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:35,986 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:35,987 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:36,050 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:36,051 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:36,060 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:36,061 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:36,061 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:36,107 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:36,108 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:36,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:36,122 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:36,122 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:36,166 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:36,167 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:36,180 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:36,181 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:36,181 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:36,222 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:36,223 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:36,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:36,241 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:36,241 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:36,294 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:36,294 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:36,308 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:36,309 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:36,310 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:36,371 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:36,372 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:36,382 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:36,383 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:36,383 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:36,427 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:36,428 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:36,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:36,438 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:36,438 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:36,483 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:36,483 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:36,494 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:36,495 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:36,495 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-11-29 23:14:36,550 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:36,551 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:36,561 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:36,562 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:36,562 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:36,656 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:36,657 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:36,667 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:36,668 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:36,668 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-11-29 23:14:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:36,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 23:14:36,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:14:36,733 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2020-11-29 23:14:36,734 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:36,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:36,746 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:36,746 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2020-11-29 23:14:36,819 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:36,820 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 75 [2020-11-29 23:14:36,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:14:36,832 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-29 23:14:36,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:14:36,837 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-29 23:14:36,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:14:36,840 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-29 23:14:36,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:14:36,846 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-29 23:14:36,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:14:36,850 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-29 23:14:36,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:14:36,854 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-29 23:14:36,856 INFO L545 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:36,952 INFO L625 ElimStorePlain]: treesize reduction 20, result has 84.5 percent of original size [2020-11-29 23:14:36,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:14:36,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-11-29 23:14:36,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:14:36,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:14:36,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:14:36,994 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:36,994 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:115 [2020-11-29 23:14:37,107 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-29 23:14:37,108 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2020-11-29 23:14:37,108 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2020-11-29 23:14:37,629 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 15 states. Result 69 states and 75 transitions. Complement of second has 49 states. [2020-11-29 23:14:37,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2020-11-29 23:14:37,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-29 23:14:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2020-11-29 23:14:37,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 4 letters. [2020-11-29 23:14:37,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 23:14:37,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 38 letters. Loop has 4 letters. [2020-11-29 23:14:37,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 23:14:37,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 8 letters. [2020-11-29 23:14:37,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 23:14:37,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 75 transitions. [2020-11-29 23:14:37,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:37,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 49 states and 53 transitions. [2020-11-29 23:14:37,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-11-29 23:14:37,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-29 23:14:37,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2020-11-29 23:14:37,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 23:14:37,638 INFO L691 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-11-29 23:14:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2020-11-29 23:14:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-11-29 23:14:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-29 23:14:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-11-29 23:14:37,642 INFO L714 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-11-29 23:14:37,642 INFO L594 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-11-29 23:14:37,642 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-29 23:14:37,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 50 transitions. [2020-11-29 23:14:37,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-29 23:14:37,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:14:37,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:14:37,644 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 11, 1, 1, 1] [2020-11-29 23:14:37,644 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 23:14:37,644 INFO L794 eck$LassoCheckResult]: Stem: 2282#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2276#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 2277#L552-3 goto; 2300#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2283#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2284#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2278#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2279#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2322#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2280#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2281#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2285#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2291#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2321#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2320#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2319#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2318#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2317#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2316#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2315#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2314#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2313#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2312#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2311#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2310#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2309#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2308#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2307#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2306#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2305#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2304#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2303#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2302#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2289#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2296#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2297#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2294#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2293#L552-1 [2020-11-29 23:14:37,644 INFO L796 eck$LassoCheckResult]: Loop: 2293#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2290#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 2286#L552-3 goto; 2287#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2293#L552-1 [2020-11-29 23:14:37,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:37,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1287728160, now seen corresponding path program 13 times [2020-11-29 23:14:37,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:37,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119109555] [2020-11-29 23:14:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 146 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:37,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119109555] [2020-11-29 23:14:37,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142793865] [2020-11-29 23:14:37,870 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08227450-e03d-4262-a48d-d61024284dff/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:14:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:14:37,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-29 23:14:37,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:14:37,982 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-29 23:14:37,983 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:37,992 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:37,996 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-11-29 23:14:37,997 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:38,006 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:38,007 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:38,007 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:38,088 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:38,088 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:38,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:38,104 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:38,104 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:38,147 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:38,148 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:38,157 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:38,158 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:38,158 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:38,208 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:38,209 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:38,219 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:38,220 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:38,221 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:38,274 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:38,275 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:38,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:38,289 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:38,289 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:38,345 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:38,346 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:38,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:38,355 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:38,356 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:38,416 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:38,416 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:38,427 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:38,427 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:38,428 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:38,481 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:38,482 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:38,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:38,496 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:38,496 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:38,550 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:38,550 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:38,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:38,568 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:38,568 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-11-29 23:14:38,636 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:38,636 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:38,647 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:38,648 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:38,648 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:38,718 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-11-29 23:14:38,719 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:38,726 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:38,726 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 23:14:38,727 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-11-29 23:14:38,812 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-11-29 23:14:38,814 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 23:14:38,825 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 23:14:38,827 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 23:14:38,827 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-11-29 23:14:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:14:38,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:14:38,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2020-11-29 23:14:38,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324523055] [2020-11-29 23:14:38,842 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 23:14:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:14:38,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 12 times [2020-11-29 23:14:38,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:14:38,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49597613] [2020-11-29 23:14:38,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:14:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:38,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:14:38,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:14:38,852 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:14:38,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:14:38,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-29 23:14:38,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2020-11-29 23:14:38,959 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. cyclomatic complexity: 6 Second operand 25 states. [2020-11-29 23:14:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:14:39,348 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-11-29 23:14:39,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 23:14:39,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 41 transitions. [2020-11-29 23:14:39,349 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 23:14:39,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2020-11-29 23:14:39,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-29 23:14:39,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-29 23:14:39,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-29 23:14:39,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 23:14:39,349 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 23:14:39,350 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 23:14:39,350 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 23:14:39,350 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-11-29 23:14:39,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-29 23:14:39,350 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 23:14:39,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-29 23:14:39,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 11:14:39 BoogieIcfgContainer [2020-11-29 23:14:39,354 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 23:14:39,355 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 23:14:39,355 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 23:14:39,355 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 23:14:39,356 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:13:54" (3/4) ... [2020-11-29 23:14:39,358 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 23:14:39,358 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 23:14:39,359 INFO L168 Benchmark]: Toolchain (without parser) took 45961.87 ms. Allocated memory was 102.8 MB in the beginning and 270.5 MB in the end (delta: 167.8 MB). Free memory was 73.5 MB in the beginning and 83.7 MB in the end (delta: -10.2 MB). Peak memory consumption was 157.3 MB. Max. memory is 16.1 GB. [2020-11-29 23:14:39,359 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 102.8 MB. Free memory is still 62.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:14:39,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.71 ms. Allocated memory is still 102.8 MB. Free memory was 73.5 MB in the beginning and 68.3 MB in the end (delta: 5.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 23:14:39,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.30 ms. Allocated memory is still 102.8 MB. Free memory was 68.3 MB in the beginning and 66.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:14:39,384 INFO L168 Benchmark]: Boogie Preprocessor took 22.97 ms. Allocated memory is still 102.8 MB. Free memory was 66.8 MB in the beginning and 65.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:14:39,384 INFO L168 Benchmark]: RCFGBuilder took 331.34 ms. Allocated memory is still 102.8 MB. Free memory was 65.5 MB in the beginning and 52.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 23:14:39,385 INFO L168 Benchmark]: BuchiAutomizer took 45153.31 ms. Allocated memory was 102.8 MB in the beginning and 270.5 MB in the end (delta: 167.8 MB). Free memory was 52.6 MB in the beginning and 83.7 MB in the end (delta: -31.1 MB). Peak memory consumption was 137.6 MB. Max. memory is 16.1 GB. [2020-11-29 23:14:39,385 INFO L168 Benchmark]: Witness Printer took 3.45 ms. Allocated memory is still 270.5 MB. Free memory is still 83.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:14:39,386 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.23 ms. Allocated memory is still 102.8 MB. Free memory is still 62.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 407.71 ms. Allocated memory is still 102.8 MB. Free memory was 73.5 MB in the beginning and 68.3 MB in the end (delta: 5.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.30 ms. Allocated memory is still 102.8 MB. Free memory was 68.3 MB in the beginning and 66.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.97 ms. Allocated memory is still 102.8 MB. Free memory was 66.8 MB in the beginning and 65.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 331.34 ms. Allocated memory is still 102.8 MB. Free memory was 65.5 MB in the beginning and 52.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 45153.31 ms. Allocated memory was 102.8 MB in the beginning and 270.5 MB in the end (delta: 167.8 MB). Free memory was 52.6 MB in the beginning and 83.7 MB in the end (delta: -31.1 MB). Peak memory consumption was 137.6 MB. Max. memory is 16.1 GB. * Witness Printer took 3.45 ms. Allocated memory is still 270.5 MB. Free memory is still 83.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 19 and consists of 4 locations. One nondeterministic module has affine ranking function -41 * aux-i-aux + 790 and consists of 16 locations. 11 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 45.0s and 14 iterations. TraceHistogramMax:12. Analysis of lassos took 23.9s. Construction of modules took 2.2s. Büchi inclusion checks took 18.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 12. Nontrivial modules had stage [1, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 67 SDslu, 496 SDs, 0 SdLazy, 2285 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc10 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital240 mio100 ax107 hnf99 lsp90 ukn45 mio100 lsp38 div100 bol100 ite100 ukn100 eq192 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms 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: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...