./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 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.1.23-635dfa2 [2018-12-09 12:27:57,205 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:27:57,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:27:57,212 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:27:57,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:27:57,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:27:57,213 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:27:57,214 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:27:57,215 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:27:57,215 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:27:57,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:27:57,216 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:27:57,217 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:27:57,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:27:57,218 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:27:57,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:27:57,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:27:57,219 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:27:57,220 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:27:57,221 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:27:57,222 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:27:57,222 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:27:57,223 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:27:57,224 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:27:57,224 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:27:57,224 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:27:57,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:27:57,225 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:27:57,226 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:27:57,226 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:27:57,226 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:27:57,227 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:27:57,227 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:27:57,227 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:27:57,228 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:27:57,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:27:57,228 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 12:27:57,236 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:27:57,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:27:57,237 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 12:27:57,237 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 12:27:57,237 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 12:27:57,237 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 12:27:57,237 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 12:27:57,237 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 12:27:57,237 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 12:27:57,238 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 12:27:57,238 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 12:27:57,238 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:27:57,238 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 12:27:57,238 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:27:57,238 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:27:57,238 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 12:27:57,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 12:27:57,239 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 12:27:57,239 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:27:57,239 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 12:27:57,239 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 12:27:57,239 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 12:27:57,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:27:57,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:27:57,240 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 12:27:57,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:27:57,240 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 12:27:57,240 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 12:27:57,240 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 12:27:57,241 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ace4aef293e19a259ba259e8c5434d0ef43394b5 [2018-12-09 12:27:57,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:27:57,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:27:57,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:27:57,271 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:27:57,271 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:27:57,272 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca_true-termination.c.i [2018-12-09 12:27:57,309 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/data/2da00ecfa/146180980f3148519efca704c6c72df4/FLAG84f5ee035 [2018-12-09 12:27:57,638 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:27:57,638 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca_true-termination.c.i [2018-12-09 12:27:57,644 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/data/2da00ecfa/146180980f3148519efca704c6c72df4/FLAG84f5ee035 [2018-12-09 12:27:58,042 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/data/2da00ecfa/146180980f3148519efca704c6c72df4 [2018-12-09 12:27:58,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:27:58,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:27:58,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:27:58,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:27:58,047 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:27:58,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:27:58" (1/1) ... [2018-12-09 12:27:58,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417514c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:58, skipping insertion in model container [2018-12-09 12:27:58,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:27:58" (1/1) ... [2018-12-09 12:27:58,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:27:58,071 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:27:58,205 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:27:58,212 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:27:58,281 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:27:58,299 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:27:58,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:58 WrapperNode [2018-12-09 12:27:58,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:27:58,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:27:58,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:27:58,301 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:27:58,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:58" (1/1) ... [2018-12-09 12:27:58,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:58" (1/1) ... [2018-12-09 12:27:58,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:27:58,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:27:58,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:27:58,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:27:58,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:58" (1/1) ... [2018-12-09 12:27:58,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:58" (1/1) ... [2018-12-09 12:27:58,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:58" (1/1) ... [2018-12-09 12:27:58,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:58" (1/1) ... [2018-12-09 12:27:58,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:58" (1/1) ... [2018-12-09 12:27:58,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:58" (1/1) ... [2018-12-09 12:27:58,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:58" (1/1) ... [2018-12-09 12:27:58,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:27:58,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:27:58,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:27:58,339 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:27:58,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:27:58,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:27:58,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 12:27:58,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:27:58,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:27:58,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:27:58,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:27:58,476 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:27:58,476 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 12:27:58,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:27:58 BoogieIcfgContainer [2018-12-09 12:27:58,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:27:58,477 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 12:27:58,477 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 12:27:58,479 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 12:27:58,480 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 12:27:58,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 12:27:58" (1/3) ... [2018-12-09 12:27:58,481 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d2ccfa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:27:58, skipping insertion in model container [2018-12-09 12:27:58,481 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 12:27:58,481 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:58" (2/3) ... [2018-12-09 12:27:58,481 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d2ccfa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:27:58, skipping insertion in model container [2018-12-09 12:27:58,481 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 12:27:58,481 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:27:58" (3/3) ... [2018-12-09 12:27:58,482 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca_true-termination.c.i [2018-12-09 12:27:58,514 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 12:27:58,514 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 12:27:58,514 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 12:27:58,514 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 12:27:58,514 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:27:58,515 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:27:58,515 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 12:27:58,515 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:27:58,515 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 12:27:58,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-12-09 12:27:58,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:27:58,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:27:58,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:27:58,541 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 12:27:58,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:27:58,542 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 12:27:58,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-12-09 12:27:58,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:27:58,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:27:58,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:27:58,543 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 12:27:58,543 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:27:58,547 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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.alloc(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.alloc(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 [2018-12-09 12:27:58,548 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 [2018-12-09 12:27:58,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:58,551 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 12:27:58,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:27:58,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:27:58,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:58,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:27:58,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:58,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:58,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2018-12-09 12:27:58,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:27:58,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:27:58,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:58,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:27:58,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:58,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:58,645 INFO L82 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2018-12-09 12:27:58,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:27:58,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:27:58,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:58,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:27:58,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:27:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:27:58,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:27:58,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:27:58,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:27:58,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:27:58,787 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 5 states. [2018-12-09 12:27:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:27:58,810 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-12-09 12:27:58,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:27:58,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2018-12-09 12:27:58,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:27:58,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2018-12-09 12:27:58,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 12:27:58,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 12:27:58,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2018-12-09 12:27:58,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 12:27:58,816 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-09 12:27:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2018-12-09 12:27:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-09 12:27:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 12:27:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-09 12:27:58,833 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-09 12:27:58,833 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-09 12:27:58,833 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 12:27:58,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2018-12-09 12:27:58,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:27:58,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:27:58,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:27:58,834 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 12:27:58,834 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 12:27:58,834 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 37#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.alloc(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.alloc(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); 38#L552-3 goto; 39#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 40#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); 42#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 43#L554-1 [2018-12-09 12:27:58,834 INFO L796 eck$LassoCheckResult]: Loop: 43#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 46#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); 44#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 43#L554-1 [2018-12-09 12:27:58,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:58,834 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2018-12-09 12:27:58,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:27:58,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:27:58,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:58,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:27:58,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:58,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:58,852 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2018-12-09 12:27:58,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:27:58,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:27:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:58,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:27:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:58,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:58,860 INFO L82 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2018-12-09 12:27:58,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:27:58,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:27:58,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:58,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:27:58,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:59,052 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2018-12-09 12:27:59,100 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:27:59,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:27:59,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:27:59,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:27:59,101 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 12:27:59,101 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:27:59,101 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:27:59,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:27:59,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-09 12:27:59,101 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:27:59,101 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:27:59,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:27:59,448 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:27:59,451 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 12:27:59,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:27:59,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:27:59,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:27:59,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:27:59,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:27:59,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:27:59,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:27:59,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:27:59,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:27:59,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:27:59,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:27:59,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:27:59,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:27:59,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:27:59,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:27:59,473 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 12:27:59,484 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 12:27:59,485 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 12:27:59,486 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 12:27:59,487 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 12:27:59,487 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 12:27:59,488 INFO L520 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 [] [2018-12-09 12:27:59,508 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2018-12-09 12:27:59,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 12:27:59,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:27:59,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:27:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:27:59,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:27:59,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:27:59,557 INFO L478 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 29 treesize of output 32 [2018-12-09 12:27:59,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:27:59,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 23 [2018-12-09 12:27:59,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-12-09 12:27:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:27:59,579 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 12:27:59,580 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-12-09 12:27:59,611 INFO L76 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. [2018-12-09 12:27:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 12:27:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 12:27:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-09 12:27:59,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-09 12:27:59,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:27:59,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-09 12:27:59,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:27:59,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2018-12-09 12:27:59,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:27:59,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-12-09 12:27:59,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:27:59,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2018-12-09 12:27:59,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 12:27:59,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-09 12:27:59,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-12-09 12:27:59,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:27:59,616 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-09 12:27:59,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-12-09 12:27:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-09 12:27:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-09 12:27:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-12-09 12:27:59,617 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-09 12:27:59,617 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-09 12:27:59,617 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 12:27:59,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-12-09 12:27:59,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:27:59,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:27:59,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:27:59,618 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-12-09 12:27:59,618 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:27:59,618 INFO L794 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 154#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.alloc(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.alloc(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); 155#L552-3 goto; 169#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 168#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); 167#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 166#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 157#L552-1 [2018-12-09 12:27:59,618 INFO L796 eck$LassoCheckResult]: Loop: 157#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); 161#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; 163#L552-3 goto; 156#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 157#L552-1 [2018-12-09 12:27:59,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:59,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2018-12-09 12:27:59,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:27:59,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:27:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:59,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:27:59,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:59,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:59,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2018-12-09 12:27:59,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:27:59,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:27:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:59,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:27:59,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:59,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:59,648 INFO L82 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2018-12-09 12:27:59,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:27:59,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:27:59,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:59,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:27:59,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:27:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:27:59,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:27:59,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:27:59,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:27:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:27:59,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:27:59,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 12:27:59,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,755 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:27:59,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:27:59,757 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,773 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-09 12:27:59,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:27:59,785 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,789 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,793 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,797 INFO L267 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. [2018-12-09 12:27:59,797 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2018-12-09 12:27:59,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:27:59,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:27:59,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:27:59,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:27:59,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,824 INFO L267 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. [2018-12-09 12:27:59,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:27:59,838 INFO L478 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 22 [2018-12-09 12:27:59,840 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-09 12:27:59,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,844 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 12:27:59,844 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:27:59,848 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2018-12-09 12:27:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:27:59,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:27:59,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2018-12-09 12:27:59,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 12:27:59,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:27:59,909 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-12-09 12:27:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:27:59,950 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-12-09 12:27:59,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:27:59,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-12-09 12:27:59,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:27:59,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 20 transitions. [2018-12-09 12:27:59,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 12:27:59,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 12:27:59,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2018-12-09 12:27:59,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:27:59,951 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-09 12:27:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2018-12-09 12:27:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-09 12:27:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-09 12:27:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-09 12:27:59,952 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-09 12:27:59,952 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-09 12:27:59,952 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 12:27:59,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-12-09 12:27:59,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:27:59,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:27:59,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:27:59,953 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2018-12-09 12:27:59,953 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:27:59,953 INFO L794 eck$LassoCheckResult]: Stem: 244#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 238#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.alloc(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.alloc(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); 239#L552-3 goto; 255#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 245#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); 246#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 254#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 253#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); 251#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 252#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 241#L552-1 [2018-12-09 12:27:59,953 INFO L796 eck$LassoCheckResult]: Loop: 241#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); 250#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; 248#L552-3 goto; 240#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 241#L552-1 [2018-12-09 12:27:59,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1269751228, now seen corresponding path program 4 times [2018-12-09 12:27:59,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:27:59,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:27:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:59,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:27:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:59,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:59,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2018-12-09 12:27:59,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:27:59,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:27:59,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:59,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:27:59,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:27:59,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:27:59,971 INFO L82 PathProgramCache]: Analyzing trace with hash 112465226, now seen corresponding path program 2 times [2018-12-09 12:27:59,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:27:59,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:27:59,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:59,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:27:59,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:27:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:00,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:28:00,041 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:28:00,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 12:28:00,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 12:28:00,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 12:28:00,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:00,065 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:28:00,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:00,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,081 INFO L478 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 3 case distinctions, treesize of input 19 treesize of output 31 [2018-12-09 12:28:00,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 12:28:00,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,101 INFO L267 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. [2018-12-09 12:28:00,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2018-12-09 12:28:00,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,117 INFO L478 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 28 [2018-12-09 12:28:00,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 19 [2018-12-09 12:28:00,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2018-12-09 12:28:00,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,139 INFO L478 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 27 treesize of output 30 [2018-12-09 12:28:00,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 30 treesize of output 18 [2018-12-09 12:28:00,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-09 12:28:00,166 INFO L478 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 13 [2018-12-09 12:28:00,168 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-09 12:28:00,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-12-09 12:28:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:00,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:28:00,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2018-12-09 12:28:00,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 12:28:00,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:28:00,228 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 12 states. [2018-12-09 12:28:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:28:00,302 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-12-09 12:28:00,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:28:00,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-12-09 12:28:00,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:00,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 23 transitions. [2018-12-09 12:28:00,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 12:28:00,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 12:28:00,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2018-12-09 12:28:00,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:28:00,304 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-09 12:28:00,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2018-12-09 12:28:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-09 12:28:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 12:28:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-09 12:28:00,305 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-09 12:28:00,305 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-09 12:28:00,305 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 12:28:00,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2018-12-09 12:28:00,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:00,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:28:00,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:28:00,306 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1] [2018-12-09 12:28:00,306 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:28:00,306 INFO L794 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 341#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.alloc(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.alloc(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); 342#L552-3 goto; 361#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 360#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); 359#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 343#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 344#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); 350#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 345#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); 358#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 356#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 348#L552-1 [2018-12-09 12:28:00,306 INFO L796 eck$LassoCheckResult]: Loop: 348#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); 349#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; 351#L552-3 goto; 352#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 348#L552-1 [2018-12-09 12:28:00,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:00,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1381845472, now seen corresponding path program 5 times [2018-12-09 12:28:00,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:00,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:00,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:00,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:00,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:00,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:00,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2018-12-09 12:28:00,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:00,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:00,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:00,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:00,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:00,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:00,331 INFO L82 PathProgramCache]: Analyzing trace with hash 320887590, now seen corresponding path program 3 times [2018-12-09 12:28:00,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:00,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:00,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:00,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:00,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:00,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:28:00,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:28:00,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 12:28:00,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-09 12:28:00,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 12:28:00,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:00,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 12:28:00,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,479 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:28:00,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:00,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,488 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-09 12:28:00,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:00,490 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,509 INFO L267 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. [2018-12-09 12:28:00,509 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:00,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:00,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:00,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,532 INFO L267 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. [2018-12-09 12:28:00,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:00,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:00,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:00,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,559 INFO L267 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. [2018-12-09 12:28:00,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:00,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:00,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:00,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,585 INFO L267 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. [2018-12-09 12:28:00,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:00,600 INFO L478 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 22 [2018-12-09 12:28:00,602 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-09 12:28:00,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,606 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 12:28:00,606 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,611 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2018-12-09 12:28:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:00,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:28:00,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2018-12-09 12:28:00,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 12:28:00,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-09 12:28:00,663 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 15 states. [2018-12-09 12:28:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:28:00,771 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-12-09 12:28:00,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:28:00,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-12-09 12:28:00,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:00,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 26 transitions. [2018-12-09 12:28:00,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 12:28:00,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 12:28:00,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2018-12-09 12:28:00,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:28:00,773 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-09 12:28:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2018-12-09 12:28:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-09 12:28:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 12:28:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-09 12:28:00,774 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-09 12:28:00,774 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-09 12:28:00,774 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 12:28:00,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2018-12-09 12:28:00,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:00,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:28:00,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:28:00,775 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2018-12-09 12:28:00,775 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:28:00,775 INFO L794 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 464#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.alloc(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.alloc(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); 465#L552-3 goto; 486#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 485#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); 483#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 466#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 467#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); 487#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 468#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 469#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); 473#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 482#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 484#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); 478#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 479#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 471#L552-1 [2018-12-09 12:28:00,775 INFO L796 eck$LassoCheckResult]: Loop: 471#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); 472#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; 474#L552-3 goto; 475#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 471#L552-1 [2018-12-09 12:28:00,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:00,775 INFO L82 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 6 times [2018-12-09 12:28:00,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:00,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:00,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:00,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:00,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:00,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:00,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 5 times [2018-12-09 12:28:00,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:00,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:00,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:00,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:00,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:00,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:00,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 4 times [2018-12-09 12:28:00,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:00,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:00,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:00,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:00,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:00,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:28:00,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:28:00,895 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 12:28:00,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 12:28:00,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 12:28:00,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:00,912 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:28:00,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:00,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,931 INFO L478 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 3 case distinctions, treesize of input 19 treesize of output 31 [2018-12-09 12:28:00,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 12:28:00,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,947 INFO L267 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. [2018-12-09 12:28:00,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2018-12-09 12:28:00,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,959 INFO L478 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 28 [2018-12-09 12:28:00,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 19 [2018-12-09 12:28:00,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2018-12-09 12:28:00,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,976 INFO L478 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 27 treesize of output 30 [2018-12-09 12:28:00,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 30 treesize of output 18 [2018-12-09 12:28:00,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-09 12:28:00,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,994 INFO L478 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 27 treesize of output 30 [2018-12-09 12:28:00,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:00,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 30 treesize of output 18 [2018-12-09 12:28:00,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:00,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-09 12:28:01,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:01,013 INFO L478 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 27 treesize of output 30 [2018-12-09 12:28:01,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:01,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 30 treesize of output 18 [2018-12-09 12:28:01,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-09 12:28:01,032 INFO L478 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 13 [2018-12-09 12:28:01,034 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-09 12:28:01,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-12-09 12:28:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:01,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:28:01,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2018-12-09 12:28:01,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 12:28:01,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-12-09 12:28:01,087 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 18 states. [2018-12-09 12:28:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:28:01,235 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-12-09 12:28:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 12:28:01,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2018-12-09 12:28:01,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:01,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 29 transitions. [2018-12-09 12:28:01,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 12:28:01,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 12:28:01,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2018-12-09 12:28:01,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:28:01,236 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-09 12:28:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2018-12-09 12:28:01,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-09 12:28:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 12:28:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-12-09 12:28:01,237 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-09 12:28:01,238 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-09 12:28:01,238 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 12:28:01,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2018-12-09 12:28:01,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:01,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:28:01,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:28:01,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1] [2018-12-09 12:28:01,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:28:01,239 INFO L794 eck$LassoCheckResult]: Stem: 613#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 607#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.alloc(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.alloc(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); 608#L552-3 goto; 617#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 625#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); 632#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 609#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 610#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); 621#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 611#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 612#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); 616#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 631#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 630#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); 629#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 628#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 627#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); 626#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 623#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 614#L552-1 [2018-12-09 12:28:01,239 INFO L796 eck$LassoCheckResult]: Loop: 614#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); 615#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; 620#L552-3 goto; 633#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 614#L552-1 [2018-12-09 12:28:01,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:01,239 INFO L82 PathProgramCache]: Analyzing trace with hash -866483296, now seen corresponding path program 7 times [2018-12-09 12:28:01,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:01,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:01,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:01,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:01,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:01,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:01,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 6 times [2018-12-09 12:28:01,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:01,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:01,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:01,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:28:01,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:01,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1312123046, now seen corresponding path program 5 times [2018-12-09 12:28:01,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:01,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:01,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:01,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:28:01,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:28:01,373 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 12:28:01,392 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-09 12:28:01,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 12:28:01,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:01,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 12:28:01,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,406 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:28:01,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:01,407 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,415 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-09 12:28:01,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:01,417 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,423 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,438 INFO L267 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. [2018-12-09 12:28:01,439 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:01,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:01,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:01,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:01,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:01,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,461 INFO L267 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. [2018-12-09 12:28:01,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:01,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:01,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:01,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:01,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:01,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,483 INFO L267 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. [2018-12-09 12:28:01,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:01,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:01,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:01,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:01,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:01,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,515 INFO L267 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. [2018-12-09 12:28:01,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:01,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:01,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:01,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:01,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:01,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,551 INFO L267 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. [2018-12-09 12:28:01,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:01,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:01,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:01,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:01,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:01,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,581 INFO L267 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. [2018-12-09 12:28:01,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:01,603 INFO L478 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 22 [2018-12-09 12:28:01,604 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 12:28:01,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,608 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-09 12:28:01,609 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:01,612 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2018-12-09 12:28:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:01,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:28:01,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2018-12-09 12:28:01,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 12:28:01,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-12-09 12:28:01,674 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 4 Second operand 21 states. [2018-12-09 12:28:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:28:01,855 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-12-09 12:28:01,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 12:28:01,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2018-12-09 12:28:01,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:01,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 32 transitions. [2018-12-09 12:28:01,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 12:28:01,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 12:28:01,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2018-12-09 12:28:01,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:28:01,856 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-09 12:28:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2018-12-09 12:28:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 12:28:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 12:28:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-12-09 12:28:01,857 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-09 12:28:01,857 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-09 12:28:01,857 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 12:28:01,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2018-12-09 12:28:01,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:01,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:28:01,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:28:01,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1] [2018-12-09 12:28:01,858 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:28:01,858 INFO L794 eck$LassoCheckResult]: Stem: 776#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 770#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.alloc(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.alloc(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); 771#L552-3 goto; 780#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 787#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); 788#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 772#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 773#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); 779#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 774#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 775#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); 799#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 798#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 797#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); 796#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 795#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 794#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); 793#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 792#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 790#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); 789#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 785#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 777#L552-1 [2018-12-09 12:28:01,858 INFO L796 eck$LassoCheckResult]: Loop: 777#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); 778#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; 783#L552-3 goto; 791#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 777#L552-1 [2018-12-09 12:28:01,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash -650410172, now seen corresponding path program 8 times [2018-12-09 12:28:01,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:01,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:01,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:01,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:01,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 7 times [2018-12-09 12:28:01,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:01,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:01,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:01,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash 904133194, now seen corresponding path program 6 times [2018-12-09 12:28:01,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:01,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:01,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:01,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:28:01,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:02,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:28:02,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:28:02,014 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-09 12:28:02,051 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-12-09 12:28:02,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 12:28:02,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:02,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 12:28:02,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,065 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:28:02,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:02,067 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,073 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-09 12:28:02,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:02,075 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,078 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,080 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,084 INFO L267 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. [2018-12-09 12:28:02,084 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:02,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:02,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,109 INFO L267 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. [2018-12-09 12:28:02,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:02,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:02,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,138 INFO L267 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. [2018-12-09 12:28:02,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:02,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:02,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,162 INFO L267 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. [2018-12-09 12:28:02,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:02,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:02,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,188 INFO L267 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. [2018-12-09 12:28:02,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:02,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:02,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,212 INFO L267 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. [2018-12-09 12:28:02,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:02,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:02,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,240 INFO L267 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. [2018-12-09 12:28:02,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,257 INFO L478 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 22 [2018-12-09 12:28:02,258 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-09 12:28:02,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,261 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 12:28:02,262 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,266 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2018-12-09 12:28:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:02,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:28:02,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 24 [2018-12-09 12:28:02,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 12:28:02,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-12-09 12:28:02,326 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 4 Second operand 24 states. [2018-12-09 12:28:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:28:02,556 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-12-09 12:28:02,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 12:28:02,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2018-12-09 12:28:02,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:02,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 35 transitions. [2018-12-09 12:28:02,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 12:28:02,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 12:28:02,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2018-12-09 12:28:02,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:28:02,558 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-09 12:28:02,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2018-12-09 12:28:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 12:28:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 12:28:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-12-09 12:28:02,559 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-09 12:28:02,559 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-09 12:28:02,559 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 12:28:02,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2018-12-09 12:28:02,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:02,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:28:02,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:28:02,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1] [2018-12-09 12:28:02,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:28:02,560 INFO L794 eck$LassoCheckResult]: Stem: 959#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 953#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.alloc(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.alloc(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); 954#L552-3 goto; 963#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 970#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); 971#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 955#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 956#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); 962#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 957#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 958#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); 985#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 984#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 983#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); 982#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 981#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 980#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); 979#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 978#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 977#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); 976#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 975#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 973#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); 972#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 968#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 960#L552-1 [2018-12-09 12:28:02,560 INFO L796 eck$LassoCheckResult]: Loop: 960#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); 961#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; 966#L552-3 goto; 974#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 960#L552-1 [2018-12-09 12:28:02,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:02,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1771949792, now seen corresponding path program 9 times [2018-12-09 12:28:02,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:02,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:02,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:02,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:02,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:02,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:02,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 8 times [2018-12-09 12:28:02,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:02,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:02,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:02,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:02,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:02,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:02,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1235899942, now seen corresponding path program 7 times [2018-12-09 12:28:02,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:02,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:02,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:02,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:02,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:02,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:28:02,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:28:02,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:28:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:02,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:02,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 12:28:02,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,772 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:28:02,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:02,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,779 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-09 12:28:02,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:02,781 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,784 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,786 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,789 INFO L267 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. [2018-12-09 12:28:02,790 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:02,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:02,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,813 INFO L267 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. [2018-12-09 12:28:02,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:02,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:02,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,851 INFO L267 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. [2018-12-09 12:28:02,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:02,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:02,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,874 INFO L267 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. [2018-12-09 12:28:02,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:02,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:02,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,899 INFO L267 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. [2018-12-09 12:28:02,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:02,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:02,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,927 INFO L267 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. [2018-12-09 12:28:02,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:02,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:02,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,951 INFO L267 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. [2018-12-09 12:28:02,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:02,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:02,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:02,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,977 INFO L267 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. [2018-12-09 12:28:02,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:02,994 INFO L478 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 22 [2018-12-09 12:28:02,995 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-09 12:28:02,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:02,999 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 12:28:02,999 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:03,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:03,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:03,002 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2018-12-09 12:28:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:03,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:28:03,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 27 [2018-12-09 12:28:03,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 12:28:03,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2018-12-09 12:28:03,054 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 4 Second operand 27 states. [2018-12-09 12:28:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:28:03,726 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-12-09 12:28:03,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 12:28:03,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2018-12-09 12:28:03,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:03,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 38 transitions. [2018-12-09 12:28:03,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 12:28:03,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 12:28:03,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2018-12-09 12:28:03,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:28:03,727 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-09 12:28:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2018-12-09 12:28:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 12:28:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 12:28:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-09 12:28:03,729 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-09 12:28:03,729 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-09 12:28:03,729 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 12:28:03,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2018-12-09 12:28:03,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:03,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:28:03,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:28:03,730 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1] [2018-12-09 12:28:03,730 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:28:03,731 INFO L794 eck$LassoCheckResult]: Stem: 1162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1156#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.alloc(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.alloc(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); 1157#L552-3 goto; 1166#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1173#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); 1174#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1158#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1159#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); 1165#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1160#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1161#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); 1191#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1190#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1189#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); 1188#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1187#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1186#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); 1185#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1184#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1183#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); 1182#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1181#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1180#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); 1179#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1178#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1176#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); 1175#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1171#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1163#L552-1 [2018-12-09 12:28:03,731 INFO L796 eck$LassoCheckResult]: Loop: 1163#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); 1164#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; 1169#L552-3 goto; 1177#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1163#L552-1 [2018-12-09 12:28:03,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1286793668, now seen corresponding path program 10 times [2018-12-09 12:28:03,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:03,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:03,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:03,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:28:03,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:03,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 9 times [2018-12-09 12:28:03,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:03,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:03,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:03,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:03,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:03,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:03,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2115625782, now seen corresponding path program 8 times [2018-12-09 12:28:03,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:03,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:03,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:03,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:28:03,931 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:28:03,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 12:28:03,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 12:28:03,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 12:28:03,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:03,958 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:28:03,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:03,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:03,973 INFO L478 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 3 case distinctions, treesize of input 19 treesize of output 31 [2018-12-09 12:28:03,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 12:28:03,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:03,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:03,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:03,992 INFO L267 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. [2018-12-09 12:28:03,992 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2018-12-09 12:28:04,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,004 INFO L478 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 28 [2018-12-09 12:28:04,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 19 [2018-12-09 12:28:04,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2018-12-09 12:28:04,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,022 INFO L478 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 27 treesize of output 30 [2018-12-09 12:28:04,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 30 treesize of output 18 [2018-12-09 12:28:04,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-09 12:28:04,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,047 INFO L478 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 27 treesize of output 30 [2018-12-09 12:28:04,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 30 treesize of output 18 [2018-12-09 12:28:04,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-09 12:28:04,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,068 INFO L478 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 27 treesize of output 30 [2018-12-09 12:28:04,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 30 treesize of output 18 [2018-12-09 12:28:04,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-09 12:28:04,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,090 INFO L478 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 27 treesize of output 30 [2018-12-09 12:28:04,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 30 treesize of output 18 [2018-12-09 12:28:04,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-09 12:28:04,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,108 INFO L478 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 27 treesize of output 30 [2018-12-09 12:28:04,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 30 treesize of output 18 [2018-12-09 12:28:04,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-09 12:28:04,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,128 INFO L478 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 27 treesize of output 30 [2018-12-09 12:28:04,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 30 treesize of output 18 [2018-12-09 12:28:04,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-09 12:28:04,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,149 INFO L478 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 27 treesize of output 30 [2018-12-09 12:28:04,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 30 treesize of output 18 [2018-12-09 12:28:04,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-09 12:28:04,172 INFO L478 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 13 [2018-12-09 12:28:04,173 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-09 12:28:04,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-12-09 12:28:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:04,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:28:04,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 30 [2018-12-09 12:28:04,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 12:28:04,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2018-12-09 12:28:04,225 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand 30 states. [2018-12-09 12:28:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:28:04,517 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-12-09 12:28:04,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 12:28:04,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2018-12-09 12:28:04,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:04,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 41 transitions. [2018-12-09 12:28:04,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 12:28:04,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 12:28:04,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2018-12-09 12:28:04,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:28:04,519 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-12-09 12:28:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2018-12-09 12:28:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 12:28:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 12:28:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-12-09 12:28:04,521 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-12-09 12:28:04,521 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-12-09 12:28:04,521 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 12:28:04,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2018-12-09 12:28:04,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:04,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:28:04,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:28:04,522 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1] [2018-12-09 12:28:04,522 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:28:04,522 INFO L794 eck$LassoCheckResult]: Stem: 1385#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1379#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.alloc(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.alloc(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); 1380#L552-3 goto; 1389#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1396#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); 1397#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1381#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1382#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); 1388#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1383#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1384#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); 1417#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1416#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1415#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); 1414#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1413#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1412#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); 1411#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1410#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1409#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); 1408#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1407#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1406#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); 1405#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1404#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1403#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); 1402#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1401#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1399#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); 1398#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1394#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1386#L552-1 [2018-12-09 12:28:04,522 INFO L796 eck$LassoCheckResult]: Loop: 1386#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); 1387#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; 1392#L552-3 goto; 1400#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1386#L552-1 [2018-12-09 12:28:04,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:04,523 INFO L82 PathProgramCache]: Analyzing trace with hash -2007908704, now seen corresponding path program 11 times [2018-12-09 12:28:04,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:04,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:04,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:04,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:04,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:04,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:04,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 10 times [2018-12-09 12:28:04,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:04,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:04,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:04,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:04,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:04,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:04,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1981227942, now seen corresponding path program 9 times [2018-12-09 12:28:04,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:04,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:04,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:04,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:04,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:04,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:28:04,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:28:04,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 12:28:04,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-09 12:28:04,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 12:28:04,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:04,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 12:28:04,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,872 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:28:04,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:04,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,881 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-09 12:28:04,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:04,882 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,888 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,893 INFO L267 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. [2018-12-09 12:28:04,893 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:04,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:04,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:04,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,924 INFO L267 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. [2018-12-09 12:28:04,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:04,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:04,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:04,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,947 INFO L267 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. [2018-12-09 12:28:04,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:04,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:04,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:04,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,972 INFO L267 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. [2018-12-09 12:28:04,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:04,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:04,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:04,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:04,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:04,995 INFO L267 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. [2018-12-09 12:28:04,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:05,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:05,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:05,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:05,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:05,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,020 INFO L267 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. [2018-12-09 12:28:05,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:05,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:05,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:05,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:05,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:05,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,050 INFO L267 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. [2018-12-09 12:28:05,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:05,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:05,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:05,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:05,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:05,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,078 INFO L267 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. [2018-12-09 12:28:05,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:05,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:05,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:05,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:05,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:05,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,120 INFO L267 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. [2018-12-09 12:28:05,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:05,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:05,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:05,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:05,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:05,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,150 INFO L267 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. [2018-12-09 12:28:05,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:05,169 INFO L478 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 22 [2018-12-09 12:28:05,171 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-09 12:28:05,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,175 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 12:28:05,175 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:05,179 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2018-12-09 12:28:05,182 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:05,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:28:05,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 33 [2018-12-09 12:28:05,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-09 12:28:05,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 12:28:05,233 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 4 Second operand 33 states. [2018-12-09 12:28:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:28:05,633 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-09 12:28:05,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 12:28:05,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2018-12-09 12:28:05,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:05,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 44 transitions. [2018-12-09 12:28:05,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 12:28:05,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 12:28:05,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2018-12-09 12:28:05,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:28:05,634 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-09 12:28:05,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2018-12-09 12:28:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 12:28:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 12:28:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-12-09 12:28:05,635 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-09 12:28:05,635 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-09 12:28:05,635 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-09 12:28:05,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2018-12-09 12:28:05,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:05,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:28:05,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:28:05,636 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2018-12-09 12:28:05,636 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:28:05,636 INFO L794 eck$LassoCheckResult]: Stem: 1628#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1622#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.alloc(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.alloc(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); 1623#L552-3 goto; 1632#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1639#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); 1640#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1624#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1625#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); 1631#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1626#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1627#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); 1663#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1662#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1661#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); 1660#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1659#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1658#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); 1657#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1656#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1655#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); 1654#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1653#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1652#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); 1651#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1650#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1649#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); 1648#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1647#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1646#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); 1645#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1644#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1642#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); 1641#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1637#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1629#L552-1 [2018-12-09 12:28:05,636 INFO L796 eck$LassoCheckResult]: Loop: 1629#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); 1630#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; 1635#L552-3 goto; 1643#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1629#L552-1 [2018-12-09 12:28:05,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:05,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 12 times [2018-12-09 12:28:05,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:05,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:05,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:05,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:05,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:05,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:05,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 11 times [2018-12-09 12:28:05,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:05,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:05,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:05,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:05,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:05,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 10 times [2018-12-09 12:28:05,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:05,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:05,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:05,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:05,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:13,489 WARN L180 SmtUtils]: Spent 7.78 s on a formula simplification. DAG size of input: 200 DAG size of output: 172 [2018-12-09 12:28:13,537 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 12:28:13,537 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 12:28:13,537 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 12:28:13,537 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 12:28:13,537 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 12:28:13,537 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 12:28:13,537 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 12:28:13,537 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 12:28:13,537 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca_true-termination.c.i_Iteration12_Lasso [2018-12-09 12:28:13,537 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 12:28:13,537 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 12:28:13,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 12:28:13,859 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 12:28:13,859 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 12:28:13,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:28:13,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:28:13,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:28:13,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:28:13,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:28:13,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:28:13,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:28:13,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:28:13,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:28:13,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:28:13,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:28:13,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:28:13,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:28:13,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:28:13,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:28:13,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:28:13,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:28:13,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:28:13,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:28:13,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:28:13,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:28:13,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:28:13,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 12:28:13,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:28:13,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 12:28:13,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 12:28:13,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:28:13,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:28:13,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:28:13,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:28:13,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:28:13,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:28:13,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:28:13,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:28:13,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:28:13,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,882 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 12:28:13,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,883 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 12:28:13,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:28:13,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:28:13,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:28:13,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:28:13,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:28:13,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:28:13,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:28:13,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,889 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 12:28:13,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,890 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 12:28:13,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:28:13,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 12:28:13,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 12:28:13,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 12:28:13,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 12:28:13,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 12:28:13,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 12:28:13,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 12:28:13,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 12:28:13,896 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 12:28:13,898 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 12:28:13,898 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 12:28:13,899 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 12:28:13,899 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-09 12:28:13,899 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 12:28:13,899 INFO L520 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)_2) = -11*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 + 224 Supporting invariants [23*ULTIMATE.start_main_#t~mem4 - 22*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 >= 0] [2018-12-09 12:28:13,921 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2018-12-09 12:28:13,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 12:28:13,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:13,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:13,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 12:28:13,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:13,972 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:28:13,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:13,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:13,979 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-09 12:28:13,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:13,981 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:13,984 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:13,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:13,990 INFO L267 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. [2018-12-09 12:28:13,990 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,013 INFO L267 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. [2018-12-09 12:28:14,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,038 INFO L267 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. [2018-12-09 12:28:14,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,081 INFO L267 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. [2018-12-09 12:28:14,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,113 INFO L267 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. [2018-12-09 12:28:14,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,142 INFO L267 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. [2018-12-09 12:28:14,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,172 INFO L267 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. [2018-12-09 12:28:14,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,206 INFO L267 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. [2018-12-09 12:28:14,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,244 INFO L267 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. [2018-12-09 12:28:14,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,288 INFO L267 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. [2018-12-09 12:28:14,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,325 INFO L267 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. [2018-12-09 12:28:14,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:14,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:14,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,353 INFO L478 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 40 treesize of output 41 [2018-12-09 12:28:14,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 30 [2018-12-09 12:28:14,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,363 INFO L267 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. [2018-12-09 12:28:14,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:35 [2018-12-09 12:28:14,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,400 INFO L478 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 3 case distinctions, treesize of input 49 treesize of output 65 [2018-12-09 12:28:14,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 51 treesize of output 57 [2018-12-09 12:28:14,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-09 12:28:14,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 51 [2018-12-09 12:28:14,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 12:28:14,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-09 12:28:14,520 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:106 [2018-12-09 12:28:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:14,579 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2018-12-09 12:28:14,579 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2018-12-09 12:28:14,622 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 15 states. Result 42 states and 44 transitions. Complement of second has 5 states. [2018-12-09 12:28:14,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2018-12-09 12:28:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 12:28:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-12-09 12:28:14,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2018-12-09 12:28:14,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:28:14,623 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 12:28:14,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:14,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:14,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 12:28:14,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,669 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:28:14,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:14,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,676 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-09 12:28:14,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:14,678 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,690 INFO L267 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. [2018-12-09 12:28:14,690 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,713 INFO L267 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. [2018-12-09 12:28:14,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,736 INFO L267 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. [2018-12-09 12:28:14,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,762 INFO L267 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. [2018-12-09 12:28:14,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,790 INFO L267 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. [2018-12-09 12:28:14,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,823 INFO L267 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. [2018-12-09 12:28:14,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,856 INFO L267 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. [2018-12-09 12:28:14,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,888 INFO L267 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. [2018-12-09 12:28:14,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,932 INFO L267 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. [2018-12-09 12:28:14,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:14,964 INFO L267 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. [2018-12-09 12:28:14,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:14,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:14,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:14,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:14,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,009 INFO L267 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. [2018-12-09 12:28:15,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:15,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:15,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,034 INFO L478 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 40 treesize of output 41 [2018-12-09 12:28:15,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 30 [2018-12-09 12:28:15,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,044 INFO L267 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. [2018-12-09 12:28:15,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:35 [2018-12-09 12:28:15,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,075 INFO L478 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 3 case distinctions, treesize of input 49 treesize of output 65 [2018-12-09 12:28:15,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 51 treesize of output 57 [2018-12-09 12:28:15,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-09 12:28:15,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 51 [2018-12-09 12:28:15,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 12:28:15,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-09 12:28:15,169 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:106 [2018-12-09 12:28:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:15,213 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 [2018-12-09 12:28:15,213 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2018-12-09 12:28:15,246 INFO L76 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. [2018-12-09 12:28:15,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 12:28:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 12:28:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-12-09 12:28:15,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2018-12-09 12:28:15,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:28:15,247 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 12:28:15,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:15,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:15,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 12:28:15,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,287 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:28:15,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:15,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,294 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-09 12:28:15,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:15,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,297 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,300 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,303 INFO L267 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. [2018-12-09 12:28:15,303 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:15,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:15,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:15,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,324 INFO L267 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. [2018-12-09 12:28:15,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:15,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:15,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:15,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,346 INFO L267 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. [2018-12-09 12:28:15,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:15,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:15,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:15,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,368 INFO L267 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. [2018-12-09 12:28:15,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:15,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:15,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:15,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,394 INFO L267 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. [2018-12-09 12:28:15,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:15,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:15,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:15,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,417 INFO L267 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. [2018-12-09 12:28:15,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:15,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:15,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:15,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,441 INFO L267 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. [2018-12-09 12:28:15,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:15,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:15,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:15,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,470 INFO L267 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. [2018-12-09 12:28:15,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:15,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:15,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:15,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,497 INFO L267 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. [2018-12-09 12:28:15,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:15,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:15,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:15,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,531 INFO L267 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. [2018-12-09 12:28:15,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:15,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:15,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:15,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,560 INFO L267 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. [2018-12-09 12:28:15,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:15,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:15,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,583 INFO L478 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 40 treesize of output 41 [2018-12-09 12:28:15,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 30 [2018-12-09 12:28:15,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,592 INFO L267 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. [2018-12-09 12:28:15,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:35 [2018-12-09 12:28:15,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,621 INFO L478 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 3 case distinctions, treesize of input 49 treesize of output 65 [2018-12-09 12:28:15,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 58 treesize of output 51 [2018-12-09 12:28:15,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:15,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 41 treesize of output 57 [2018-12-09 12:28:15,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-09 12:28:15,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 12:28:15,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-09 12:28:15,692 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:106 [2018-12-09 12:28:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:15,735 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 [2018-12-09 12:28:15,735 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2018-12-09 12:28:15,935 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 15 states. Result 48 states and 52 transitions. Complement of second has 34 states. [2018-12-09 12:28:15,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 12 stem states 0 non-accepting loop states 2 accepting loop states [2018-12-09 12:28:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 12:28:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2018-12-09 12:28:15,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 53 transitions. Stem has 34 letters. Loop has 4 letters. [2018-12-09 12:28:15,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:28:15,936 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 12:28:15,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:15,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:15,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 12:28:15,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,979 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:28:15,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:15,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,986 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-09 12:28:15,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:15,988 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,991 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:15,997 INFO L267 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. [2018-12-09 12:28:15,997 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:16,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:16,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:16,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,024 INFO L267 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. [2018-12-09 12:28:16,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:16,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:16,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:16,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,050 INFO L267 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. [2018-12-09 12:28:16,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:16,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:16,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:16,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,076 INFO L267 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. [2018-12-09 12:28:16,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:16,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:16,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:16,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,114 INFO L267 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. [2018-12-09 12:28:16,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:16,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:16,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:16,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,152 INFO L267 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. [2018-12-09 12:28:16,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:16,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:16,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:16,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,178 INFO L267 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. [2018-12-09 12:28:16,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:16,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:16,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:16,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,205 INFO L267 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. [2018-12-09 12:28:16,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:16,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:16,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:16,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,236 INFO L267 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. [2018-12-09 12:28:16,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:16,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:16,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:16,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,263 INFO L267 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. [2018-12-09 12:28:16,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:16,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:16,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:16,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,291 INFO L267 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. [2018-12-09 12:28:16,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2018-12-09 12:28:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:16,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:16,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,314 INFO L478 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 40 treesize of output 41 [2018-12-09 12:28:16,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 30 [2018-12-09 12:28:16,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,323 INFO L267 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. [2018-12-09 12:28:16,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:35 [2018-12-09 12:28:16,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,360 INFO L478 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 3 case distinctions, treesize of input 49 treesize of output 65 [2018-12-09 12:28:16,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 58 treesize of output 51 [2018-12-09 12:28:16,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 41 treesize of output 57 [2018-12-09 12:28:16,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-09 12:28:16,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 12:28:16,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 12:28:16,435 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:71 [2018-12-09 12:28:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:16,463 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2018-12-09 12:28:16,463 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2018-12-09 12:28:16,667 INFO L76 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. [2018-12-09 12:28:16,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-09 12:28:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 12:28:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2018-12-09 12:28:16,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 4 letters. [2018-12-09 12:28:16,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:28:16,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 38 letters. Loop has 4 letters. [2018-12-09 12:28:16,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:28:16,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 8 letters. [2018-12-09 12:28:16,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 12:28:16,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 75 transitions. [2018-12-09 12:28:16,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:16,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 49 states and 53 transitions. [2018-12-09 12:28:16,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-09 12:28:16,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 12:28:16,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2018-12-09 12:28:16,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 12:28:16,670 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-12-09 12:28:16,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2018-12-09 12:28:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-12-09 12:28:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 12:28:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-12-09 12:28:16,671 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-12-09 12:28:16,671 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-12-09 12:28:16,671 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-09 12:28:16,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 50 transitions. [2018-12-09 12:28:16,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 12:28:16,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 12:28:16,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 12:28:16,672 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 11, 1, 1, 1] [2018-12-09 12:28:16,672 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 12:28:16,672 INFO L794 eck$LassoCheckResult]: Stem: 2583#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2577#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.alloc(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.alloc(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); 2578#L552-3 goto; 2601#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2584#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); 2585#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2579#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2580#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); 2623#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2581#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2582#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); 2586#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2592#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2622#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); 2621#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2620#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2619#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); 2618#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2617#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2616#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); 2615#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2614#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2613#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); 2612#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2611#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2610#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); 2609#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2608#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2607#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); 2606#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2605#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2604#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); 2603#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2590#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2597#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); 2598#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2595#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2594#L552-1 [2018-12-09 12:28:16,672 INFO L796 eck$LassoCheckResult]: Loop: 2594#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); 2591#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; 2587#L552-3 goto; 2588#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2594#L552-1 [2018-12-09 12:28:16,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:16,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1287728160, now seen corresponding path program 13 times [2018-12-09 12:28:16,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:16,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:16,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:16,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:28:16,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 146 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:16,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:28:16,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1f68ad0-1f37-4673-b86b-a2f08607e79f/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:28:16,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:28:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:28:16,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:28:16,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-09 12:28:16,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,918 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 12:28:16,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:16,919 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,934 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-09 12:28:16,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 12:28:16,935 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,938 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,943 INFO L267 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. [2018-12-09 12:28:16,943 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:16,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:16,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:16,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,965 INFO L267 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. [2018-12-09 12:28:16,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:16,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:16,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:16,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:16,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:16,988 INFO L267 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. [2018-12-09 12:28:16,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:17,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:17,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:17,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,013 INFO L267 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. [2018-12-09 12:28:17,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:17,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:17,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:17,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,045 INFO L267 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. [2018-12-09 12:28:17,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:17,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:17,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:17,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,072 INFO L267 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. [2018-12-09 12:28:17,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:17,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:17,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:17,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,099 INFO L267 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. [2018-12-09 12:28:17,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:17,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:17,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:17,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,130 INFO L267 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. [2018-12-09 12:28:17,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:17,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:17,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:17,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,160 INFO L267 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. [2018-12-09 12:28:17,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:17,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:17,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:17,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,190 INFO L267 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. [2018-12-09 12:28:17,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:17,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 12:28:17,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 12:28:17,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-12-09 12:28:17,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,227 INFO L267 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. [2018-12-09 12:28:17,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-12-09 12:28:17,249 INFO L478 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 22 [2018-12-09 12:28:17,251 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-09 12:28:17,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,256 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 12:28:17,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:28:17,260 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2018-12-09 12:28:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:28:17,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:28:17,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 36 [2018-12-09 12:28:17,278 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 12:28:17,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:28:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 12 times [2018-12-09 12:28:17,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:28:17,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:28:17,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:17,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:28:17,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:28:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:28:17,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-09 12:28:17,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 12:28:17,318 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. cyclomatic complexity: 6 Second operand 36 states. [2018-12-09 12:28:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:28:17,665 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-12-09 12:28:17,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 12:28:17,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 41 transitions. [2018-12-09 12:28:17,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 12:28:17,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2018-12-09 12:28:17,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 12:28:17,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 12:28:17,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 12:28:17,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 12:28:17,666 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 12:28:17,666 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 12:28:17,666 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 12:28:17,666 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-09 12:28:17,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 12:28:17,666 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 12:28:17,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 12:28:17,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 12:28:17 BoogieIcfgContainer [2018-12-09 12:28:17,670 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 12:28:17,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:28:17,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:28:17,670 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:28:17,671 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:27:58" (3/4) ... [2018-12-09 12:28:17,673 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 12:28:17,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:28:17,674 INFO L168 Benchmark]: Toolchain (without parser) took 19629.51 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.0 MB). Free memory was 950.6 MB in the beginning and 866.0 MB in the end (delta: 84.6 MB). Peak memory consumption was 333.6 MB. Max. memory is 11.5 GB. [2018-12-09 12:28:17,674 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:28:17,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-09 12:28:17,674 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:28:17,674 INFO L168 Benchmark]: Boogie Preprocessor took 14.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:28:17,674 INFO L168 Benchmark]: RCFGBuilder took 137.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-09 12:28:17,674 INFO L168 Benchmark]: BuchiAutomizer took 19192.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.4 MB). Free memory was 1.1 GB in the beginning and 874.3 MB in the end (delta: 214.2 MB). Peak memory consumption was 341.6 MB. Max. memory is 11.5 GB. [2018-12-09 12:28:17,675 INFO L168 Benchmark]: Witness Printer took 2.78 ms. Allocated memory is still 1.3 GB. Free memory is still 866.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:28:17,675 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 137.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19192.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.4 MB). Free memory was 1.1 GB in the beginning and 874.3 MB in the end (delta: 214.2 MB). Peak memory consumption was 341.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.78 ms. Allocated memory is still 1.3 GB. Free memory is still 866.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 -11 * unknown-#memory_int-unknown[i][i] + 224 and consists of 16 locations. 11 modules have a trivial ranking function, the largest among these consists of 36 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.1s and 14 iterations. TraceHistogramMax:12. Analysis of lassos took 13.6s. Construction of modules took 1.6s. Büchi inclusion checks took 3.7s. 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, 0, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 92 SDtfs, 126 SDslu, 591 SDs, 0 SdLazy, 3330 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc10 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital253 mio100 ax107 hnf100 lsp89 ukn46 mio100 lsp42 div100 bol100 ite100 ukn100 eq175 hnf89 smp91 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 2ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...