./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9becd42a466bdbd2531661a22b57e70854c9d9ea .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 04:54:36,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:54:36,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:54:36,230 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:54:36,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:54:36,231 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:54:36,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:54:36,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:54:36,233 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:54:36,233 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:54:36,234 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:54:36,234 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:54:36,234 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:54:36,235 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:54:36,235 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:54:36,236 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:54:36,236 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:54:36,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:54:36,238 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:54:36,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:54:36,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:54:36,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:54:36,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:54:36,241 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:54:36,241 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:54:36,242 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:54:36,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:54:36,243 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:54:36,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:54:36,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:54:36,244 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:54:36,244 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:54:36,244 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:54:36,244 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:54:36,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:54:36,245 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:54:36,245 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2018-12-09 04:54:36,252 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:54:36,253 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:54:36,253 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:54:36,253 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 04:54:36,253 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 04:54:36,254 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 04:54:36,254 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 04:54:36,254 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 04:54:36,254 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 04:54:36,254 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 04:54:36,254 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 04:54:36,254 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 04:54:36,254 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 04:54:36,255 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 04:54:36,255 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 04:54:36,255 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:54:36,255 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:54:36,255 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 04:54:36,255 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:54:36,255 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:54:36,256 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:54:36,256 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 04:54:36,256 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 04:54:36,256 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:54:36,256 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:54:36,256 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:54:36,256 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:54:36,256 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:54:36,256 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 04:54:36,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:54:36,257 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:54:36,257 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:54:36,257 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 04:54:36,257 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:54:36,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 04:54:36,257 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan 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(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9becd42a466bdbd2531661a22b57e70854c9d9ea [2018-12-09 04:54:36,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:54:36,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:54:36,286 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:54:36,287 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:54:36,288 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:54:36,288 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-12-09 04:54:36,332 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/data/e83362741/a52ee98b2ae64f58b7d034c08e4452d1/FLAG53571575a [2018-12-09 04:54:36,700 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:54:36,701 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-12-09 04:54:36,707 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/data/e83362741/a52ee98b2ae64f58b7d034c08e4452d1/FLAG53571575a [2018-12-09 04:54:37,074 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/data/e83362741/a52ee98b2ae64f58b7d034c08e4452d1 [2018-12-09 04:54:37,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:54:37,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:54:37,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:54:37,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:54:37,080 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:54:37,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:54:37" (1/1) ... [2018-12-09 04:54:37,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e31f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:54:37, skipping insertion in model container [2018-12-09 04:54:37,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:54:37" (1/1) ... [2018-12-09 04:54:37,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:54:37,118 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:54:37,287 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:54:37,293 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:54:37,346 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:54:37,367 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:54:37,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:54:37 WrapperNode [2018-12-09 04:54:37,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:54:37,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:54:37,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:54:37,368 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:54:37,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:54:37" (1/1) ... [2018-12-09 04:54:37,381 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:54:37" (1/1) ... [2018-12-09 04:54:37,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:54:37,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:54:37,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:54:37,386 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:54:37,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:54:37" (1/1) ... [2018-12-09 04:54:37,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:54:37" (1/1) ... [2018-12-09 04:54:37,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:54:37" (1/1) ... [2018-12-09 04:54:37,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:54:37" (1/1) ... [2018-12-09 04:54:37,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:54:37" (1/1) ... [2018-12-09 04:54:37,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:54:37" (1/1) ... [2018-12-09 04:54:37,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:54:37" (1/1) ... [2018-12-09 04:54:37,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:54:37,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:54:37,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:54:37,403 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:54:37,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:54:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:54:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 04:54:37,434 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 04:54:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:54:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 04:54:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 04:54:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 04:54:37,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 04:54:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 04:54:37,434 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 04:54:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 04:54:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 04:54:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:54:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:54:37,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:54:37,634 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:54:37,634 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 04:54:37,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:54:37 BoogieIcfgContainer [2018-12-09 04:54:37,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:54:37,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 04:54:37,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 04:54:37,637 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 04:54:37,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:54:37" (1/3) ... [2018-12-09 04:54:37,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef4841c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:54:37, skipping insertion in model container [2018-12-09 04:54:37,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:54:37" (2/3) ... [2018-12-09 04:54:37,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef4841c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:54:37, skipping insertion in model container [2018-12-09 04:54:37,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:54:37" (3/3) ... [2018-12-09 04:54:37,638 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-12-09 04:54:37,644 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 04:54:37,648 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-12-09 04:54:37,658 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-12-09 04:54:37,673 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 04:54:37,673 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 04:54:37,673 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 04:54:37,673 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:54:37,673 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:54:37,673 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 04:54:37,673 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:54:37,673 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 04:54:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-12-09 04:54:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 04:54:37,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:54:37,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:54:37,688 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 04:54:37,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:54:37,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1332576508, now seen corresponding path program 1 times [2018-12-09 04:54:37,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:54:37,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:37,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:54:37,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:37,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:54:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:54:37,768 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 04:54:37,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:54:37,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:54:37,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:54:37,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 04:54:37,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 04:54:37,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 04:54:37,782 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-12-09 04:54:37,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:54:37,793 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-12-09 04:54:37,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 04:54:37,793 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-09 04:54:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:54:37,798 INFO L225 Difference]: With dead ends: 60 [2018-12-09 04:54:37,798 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 04:54:37,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 04:54:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 04:54:37,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-09 04:54:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 04:54:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-12-09 04:54:37,820 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 10 [2018-12-09 04:54:37,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:54:37,820 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-12-09 04:54:37,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 04:54:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-12-09 04:54:37,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 04:54:37,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:54:37,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:54:37,821 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 04:54:37,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:54:37,822 INFO L82 PathProgramCache]: Analyzing trace with hash 704817717, now seen corresponding path program 1 times [2018-12-09 04:54:37,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:54:37,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:37,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:54:37,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:37,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:54:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:54:37,871 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 04:54:37,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:54:37,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:54:37,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:54:37,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:54:37,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:54:37,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:54:37,873 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 4 states. [2018-12-09 04:54:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:54:37,956 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-12-09 04:54:37,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:54:37,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-09 04:54:37,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:54:37,957 INFO L225 Difference]: With dead ends: 68 [2018-12-09 04:54:37,957 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 04:54:37,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:54:37,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 04:54:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2018-12-09 04:54:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 04:54:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2018-12-09 04:54:37,963 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 12 [2018-12-09 04:54:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:54:37,963 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-12-09 04:54:37,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:54:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-12-09 04:54:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 04:54:37,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:54:37,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:54:37,964 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 04:54:37,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:54:37,964 INFO L82 PathProgramCache]: Analyzing trace with hash 704817718, now seen corresponding path program 1 times [2018-12-09 04:54:37,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:54:37,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:37,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:54:37,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:37,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:54:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:54:38,001 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 04:54:38,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:54:38,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:54:38,002 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:54:38,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:54:38,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:54:38,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:54:38,002 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 4 states. [2018-12-09 04:54:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:54:38,089 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-12-09 04:54:38,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:54:38,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-09 04:54:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:54:38,090 INFO L225 Difference]: With dead ends: 73 [2018-12-09 04:54:38,090 INFO L226 Difference]: Without dead ends: 73 [2018-12-09 04:54:38,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:54:38,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-09 04:54:38,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2018-12-09 04:54:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 04:54:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-12-09 04:54:38,093 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 12 [2018-12-09 04:54:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:54:38,093 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-12-09 04:54:38,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:54:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-12-09 04:54:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 04:54:38,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:54:38,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:54:38,094 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 04:54:38,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:54:38,094 INFO L82 PathProgramCache]: Analyzing trace with hash 807013111, now seen corresponding path program 1 times [2018-12-09 04:54:38,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:54:38,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:38,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:54:38,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:38,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:54:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:54:38,116 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 04:54:38,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:54:38,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:54:38,116 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:54:38,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:54:38,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:54:38,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:54:38,117 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 4 states. [2018-12-09 04:54:38,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:54:38,162 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-12-09 04:54:38,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:54:38,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-09 04:54:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:54:38,163 INFO L225 Difference]: With dead ends: 69 [2018-12-09 04:54:38,163 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 04:54:38,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:54:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 04:54:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-12-09 04:54:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 04:54:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-12-09 04:54:38,166 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 19 [2018-12-09 04:54:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:54:38,166 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-12-09 04:54:38,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:54:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-12-09 04:54:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 04:54:38,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:54:38,167 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:54:38,167 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 04:54:38,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:54:38,167 INFO L82 PathProgramCache]: Analyzing trace with hash -605432418, now seen corresponding path program 1 times [2018-12-09 04:54:38,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:54:38,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:38,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:54:38,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:38,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:54:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:54:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:54:38,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:54:38,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:54:38,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:54:38,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:54:38,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:54:38,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:54:38,240 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 7 states. [2018-12-09 04:54:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:54:38,365 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-12-09 04:54:38,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:54:38,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-09 04:54:38,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:54:38,366 INFO L225 Difference]: With dead ends: 80 [2018-12-09 04:54:38,366 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 04:54:38,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:54:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 04:54:38,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2018-12-09 04:54:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 04:54:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-12-09 04:54:38,370 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 21 [2018-12-09 04:54:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:54:38,370 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-12-09 04:54:38,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:54:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-12-09 04:54:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 04:54:38,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:54:38,371 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:54:38,371 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 04:54:38,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:54:38,372 INFO L82 PathProgramCache]: Analyzing trace with hash 818584394, now seen corresponding path program 1 times [2018-12-09 04:54:38,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:54:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:38,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:54:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:38,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:54:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:54:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:54:38,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:54:38,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:54:38,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:54:38,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:54:38,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:54:38,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:54:38,416 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-12-09 04:54:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:54:38,500 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-12-09 04:54:38,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:54:38,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-09 04:54:38,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:54:38,501 INFO L225 Difference]: With dead ends: 62 [2018-12-09 04:54:38,501 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 04:54:38,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:54:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 04:54:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-12-09 04:54:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 04:54:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-12-09 04:54:38,505 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 21 [2018-12-09 04:54:38,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:54:38,505 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-12-09 04:54:38,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:54:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-12-09 04:54:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 04:54:38,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:54:38,506 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:54:38,506 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 04:54:38,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:54:38,507 INFO L82 PathProgramCache]: Analyzing trace with hash 818584395, now seen corresponding path program 1 times [2018-12-09 04:54:38,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:54:38,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:38,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:54:38,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:38,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:54:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:54:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:54:38,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:54:38,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:54:38,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:54:38,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:54:38,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:54:38,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:54:38,575 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-12-09 04:54:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:54:38,691 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-12-09 04:54:38,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:54:38,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-09 04:54:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:54:38,692 INFO L225 Difference]: With dead ends: 57 [2018-12-09 04:54:38,692 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 04:54:38,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-09 04:54:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 04:54:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-12-09 04:54:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-09 04:54:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-12-09 04:54:38,695 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 21 [2018-12-09 04:54:38,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:54:38,695 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-12-09 04:54:38,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:54:38,695 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-12-09 04:54:38,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 04:54:38,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:54:38,696 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:54:38,696 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 04:54:38,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:54:38,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1299755991, now seen corresponding path program 1 times [2018-12-09 04:54:38,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:54:38,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:38,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:54:38,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:38,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:54:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:54:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:54:38,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:54:38,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:54:38,836 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-09 04:54:38,837 INFO L205 CegarAbsIntRunner]: [0], [1], [10], [16], [18], [23], [26], [32], [34], [35], [38], [44], [46], [49], [52], [56], [59], [62], [71], [72], [73], [81], [83], [86], [114], [115], [116] [2018-12-09 04:54:38,856 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 04:54:38,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 04:54:39,038 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 04:54:39,039 INFO L272 AbstractInterpreter]: Visited 27 different actions 60 times. Merged at 18 different actions 31 times. Never widened. Performed 638 root evaluator evaluations with a maximum evaluation depth of 3. Performed 638 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 34 variables. [2018-12-09 04:54:39,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:54:39,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 04:54:39,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:54:39,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/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 04:54:39,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:54:39,055 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:54:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:54:39,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:54:39,112 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 6 treesize of output 5 [2018-12-09 04:54:39,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 04:54:39,163 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 04:54:39,165 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 04:54:39,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-09 04:54:39,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:39,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:39,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 04:54:39,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-12-09 04:54:39,214 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 04:54:39,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 04:54:39,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,231 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-09 04:54:39,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:39,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 22 treesize of output 14 [2018-12-09 04:54:39,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2018-12-09 04:54:39,261 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 20 treesize of output 16 [2018-12-09 04:54:39,263 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 16 treesize of output 4 [2018-12-09 04:54:39,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-12-09 04:54:39,301 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 04:54:39,303 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 04:54:39,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,310 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 04:54:39,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-12-09 04:54:39,315 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 27 treesize of output 28 [2018-12-09 04:54:39,317 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 16 treesize of output 1 [2018-12-09 04:54:39,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:14 [2018-12-09 04:54:39,356 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 15 treesize of output 11 [2018-12-09 04:54:39,357 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 11 treesize of output 3 [2018-12-09 04:54:39,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-12-09 04:54:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:54:39,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:54:39,397 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:54:39,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:54:39,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:54:39,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-12-09 04:54:39,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:54:39,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:54:39,524 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:54:39,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:54:39,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-09 04:54:39,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:54 [2018-12-09 04:54:39,616 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 30 treesize of output 28 [2018-12-09 04:54:39,617 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-12-09 04:54:39,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 14 [2018-12-09 04:54:39,643 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:39,644 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 17 treesize of output 11 [2018-12-09 04:54:39,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,653 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:54:39,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:54:39,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 21 treesize of output 19 [2018-12-09 04:54:39,666 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 6 treesize of output 1 [2018-12-09 04:54:39,666 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,669 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:39,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-12-09 04:54:39,689 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:44, output treesize:77 [2018-12-09 04:54:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:54:39,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:54:39,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 31 [2018-12-09 04:54:39,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:54:39,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 04:54:39,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 04:54:39,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2018-12-09 04:54:39,782 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 20 states. [2018-12-09 04:54:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:54:40,070 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-12-09 04:54:40,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 04:54:40,070 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-12-09 04:54:40,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:54:40,071 INFO L225 Difference]: With dead ends: 79 [2018-12-09 04:54:40,071 INFO L226 Difference]: Without dead ends: 73 [2018-12-09 04:54:40,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=283, Invalid=1123, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 04:54:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-09 04:54:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2018-12-09 04:54:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 04:54:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-12-09 04:54:40,074 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 30 [2018-12-09 04:54:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:54:40,074 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-12-09 04:54:40,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 04:54:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-12-09 04:54:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 04:54:40,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:54:40,075 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:54:40,075 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 04:54:40,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:54:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2056192510, now seen corresponding path program 2 times [2018-12-09 04:54:40,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:54:40,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:40,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:54:40,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:54:40,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:54:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:54:40,254 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:54:40,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:54:40,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:54:40,254 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:54:40,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:54:40,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:54:40,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/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 04:54:40,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 04:54:40,262 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 04:54:40,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 04:54:40,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:54:40,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:54:40,297 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 6 treesize of output 5 [2018-12-09 04:54:40,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 04:54:40,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:40,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:40,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 04:54:40,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-12-09 04:54:40,357 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 04:54:40,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 04:54:40,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,369 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 04:54:40,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-12-09 04:54:40,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:40,426 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 46 treesize of output 47 [2018-12-09 04:54:40,427 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 12 treesize of output 1 [2018-12-09 04:54:40,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:33 [2018-12-09 04:54:40,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:40,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:40,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:40,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-09 04:54:40,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:37 [2018-12-09 04:54:40,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:40,481 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 43 treesize of output 44 [2018-12-09 04:54:40,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 04:54:40,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,495 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 04:54:40,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:54 [2018-12-09 04:54:40,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:40,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:40,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 92 [2018-12-09 04:54:40,578 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 12 treesize of output 1 [2018-12-09 04:54:40,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,594 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 04:54:40,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:78 [2018-12-09 04:54:40,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 76 [2018-12-09 04:54:40,627 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 22 treesize of output 21 [2018-12-09 04:54:40,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,639 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 04:54:40,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:84 [2018-12-09 04:54:40,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 51 [2018-12-09 04:54:40,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-09 04:54:40,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,713 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 19 treesize of output 10 [2018-12-09 04:54:40,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,719 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 7 treesize of output 1 [2018-12-09 04:54:40,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:5 [2018-12-09 04:54:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:54:40,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:54:40,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:40,854 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:54:40,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:54:40,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-12-09 04:54:40,865 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:82 [2018-12-09 04:54:49,130 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 47 DAG size of output: 18 [2018-12-09 04:54:49,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 46 treesize of output 41 [2018-12-09 04:54:49,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:49,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 04:54:49,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:37 [2018-12-09 04:54:49,333 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:54:49,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:54:49,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-09 04:54:49,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:56 [2018-12-09 04:54:49,488 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 83 treesize of output 55 [2018-12-09 04:54:49,502 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 11 treesize of output 10 [2018-12-09 04:54:49,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:49,512 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 62 [2018-12-09 04:54:49,584 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-12-09 04:54:49,587 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-09 04:54:49,588 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:49,597 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:49,599 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-12-09 04:54:49,601 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-09 04:54:49,603 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:49,613 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:49,615 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-12-09 04:54:49,623 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-09 04:54:49,624 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:49,632 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:49,634 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2018-12-09 04:54:49,636 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-09 04:54:49,637 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:49,645 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:49,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 51 [2018-12-09 04:54:49,737 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,739 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 64 [2018-12-09 04:54:49,747 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:49,779 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,780 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 42 treesize of output 48 [2018-12-09 04:54:49,780 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:49,802 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:54:49,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2018-12-09 04:54:49,813 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,815 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 63 [2018-12-09 04:54:49,821 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:49,852 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,854 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 41 treesize of output 47 [2018-12-09 04:54:49,854 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:49,880 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:54:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2018-12-09 04:54:49,893 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 46 [2018-12-09 04:54:49,894 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:49,911 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,913 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:49,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 62 [2018-12-09 04:54:49,919 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:49,944 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:54:50,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 42 treesize of output 38 [2018-12-09 04:54:50,074 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-09 04:54:50,076 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,081 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2018-12-09 04:54:50,088 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 44 [2018-12-09 04:54:50,097 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-12-09 04:54:50,121 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-12-09 04:54:50,122 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,138 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-12-09 04:54:50,138 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,153 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:54:50,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 46 treesize of output 40 [2018-12-09 04:54:50,157 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,157 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,158 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-12-09 04:54:50,162 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:50,174 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:54:50,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2018-12-09 04:54:50,181 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-12-09 04:54:50,182 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,197 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-09 04:54:50,197 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,210 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 46 [2018-12-09 04:54:50,219 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 4 xjuncts. [2018-12-09 04:54:50,238 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:54:50,243 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 1 case distinctions, treesize of input 43 treesize of output 45 [2018-12-09 04:54:50,246 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-12-09 04:54:50,247 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,262 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 46 [2018-12-09 04:54:50,273 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 4 xjuncts. [2018-12-09 04:54:50,295 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-09 04:54:50,296 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,308 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:54:50,313 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 1 case distinctions, treesize of input 47 treesize of output 47 [2018-12-09 04:54:50,316 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,317 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,318 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 45 [2018-12-09 04:54:50,322 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:50,348 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,348 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,351 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 67 [2018-12-09 04:54:50,361 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 7 xjuncts. [2018-12-09 04:54:50,411 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-12-09 04:54:50,412 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,413 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-12-09 04:54:50,414 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,441 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 04:54:50,448 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 1 case distinctions, treesize of input 45 treesize of output 47 [2018-12-09 04:54:50,450 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-12-09 04:54:50,452 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,468 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-09 04:54:50,468 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,482 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 48 [2018-12-09 04:54:50,491 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 4 xjuncts. [2018-12-09 04:54:50,511 INFO L267 ElimStorePlain]: Start of recursive call 43: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:54:50,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2018-12-09 04:54:50,517 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,518 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,520 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 65 [2018-12-09 04:54:50,530 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 6 xjuncts. [2018-12-09 04:54:50,571 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,571 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,572 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2018-12-09 04:54:50,577 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:50,611 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-09 04:54:50,612 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,613 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-12-09 04:54:50,613 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,644 INFO L267 ElimStorePlain]: Start of recursive call 47: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 04:54:50,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 44 treesize of output 40 [2018-12-09 04:54:50,647 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-09 04:54:50,648 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,654 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,782 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 1 case distinctions, treesize of input 40 treesize of output 42 [2018-12-09 04:54:50,784 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 25 treesize of output 17 [2018-12-09 04:54:50,784 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,798 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,798 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,807 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:50,818 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 65 [2018-12-09 04:54:50,820 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 34 [2018-12-09 04:54:50,822 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:50,841 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,841 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,843 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2018-12-09 04:54:50,846 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:50,861 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:54:50,876 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:54:50,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 57 [2018-12-09 04:54:50,896 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,897 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,902 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:50,910 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 60 [2018-12-09 04:54:50,912 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:50,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2018-12-09 04:54:50,916 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:50,931 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:54:51,008 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 30 treesize of output 22 [2018-12-09 04:54:51,008 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:51,084 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-09 04:54:51,085 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:51,155 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,156 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,160 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:51,176 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 78 [2018-12-09 04:54:51,178 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,180 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,180 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:51,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2018-12-09 04:54:51,185 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:51,210 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,210 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,213 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 66 [2018-12-09 04:54:51,224 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 6 xjuncts. [2018-12-09 04:54:51,248 INFO L267 ElimStorePlain]: Start of recursive call 64: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:54:51,332 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,333 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,337 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:51,353 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 78 [2018-12-09 04:54:51,356 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 61 [2018-12-09 04:54:51,365 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 4 xjuncts. [2018-12-09 04:54:51,401 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,401 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,402 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,403 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,404 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,405 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 51 [2018-12-09 04:54:51,408 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:51,438 INFO L267 ElimStorePlain]: Start of recursive call 67: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:54:51,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 45 [2018-12-09 04:54:51,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-12-09 04:54:51,560 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:51,561 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 31 treesize of output 25 [2018-12-09 04:54:51,561 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:51,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-12-09 04:54:51,566 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:51,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2018-12-09 04:54:51,604 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:51,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 42 [2018-12-09 04:54:51,613 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 3 xjuncts. [2018-12-09 04:54:51,640 INFO L267 ElimStorePlain]: Start of recursive call 70: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 04:54:51,714 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-12-09 04:54:51,714 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:51,716 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-12-09 04:54:51,716 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:51,860 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,861 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,865 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:51,883 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 65 [2018-12-09 04:54:51,886 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:51,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 58 [2018-12-09 04:54:51,900 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 7 xjuncts. [2018-12-09 04:54:51,932 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:54:51,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 27 treesize of output 22 [2018-12-09 04:54:51,988 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:52,036 INFO L267 ElimStorePlain]: Start of recursive call 59: 10 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-09 04:54:52,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2018-12-09 04:54:52,058 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,058 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,074 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:52,094 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 83 [2018-12-09 04:54:52,096 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,098 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,100 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 46 [2018-12-09 04:54:52,103 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:52,144 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,144 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,146 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 56 [2018-12-09 04:54:52,154 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 4 xjuncts. [2018-12-09 04:54:52,185 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,186 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,188 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 61 [2018-12-09 04:54:52,199 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 7 xjuncts. [2018-12-09 04:54:52,221 INFO L267 ElimStorePlain]: Start of recursive call 82: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:54:52,311 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 28 treesize of output 20 [2018-12-09 04:54:52,311 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:52,351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 04:54:52,352 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:52,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2018-12-09 04:54:52,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-12-09 04:54:52,426 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:52,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-12-09 04:54:52,432 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:52,433 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 29 treesize of output 23 [2018-12-09 04:54:52,433 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:52,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 40 [2018-12-09 04:54:52,473 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 3 xjuncts. [2018-12-09 04:54:52,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2018-12-09 04:54:52,477 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:52,506 INFO L267 ElimStorePlain]: Start of recursive call 88: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 04:54:52,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 20 [2018-12-09 04:54:52,559 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:52,658 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,659 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,661 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:52,669 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 68 [2018-12-09 04:54:52,671 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,672 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:54:52,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 36 [2018-12-09 04:54:52,674 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:52,696 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,696 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,698 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2018-12-09 04:54:52,701 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:52,718 INFO L267 ElimStorePlain]: Start of recursive call 95: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:54:52,821 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-09 04:54:52,821 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:52,822 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-09 04:54:52,822 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:52,866 INFO L267 ElimStorePlain]: Start of recursive call 81: 10 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-09 04:54:52,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 57 [2018-12-09 04:54:52,990 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,991 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:52,996 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:53,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 64 [2018-12-09 04:54:53,007 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 6 xjuncts. [2018-12-09 04:54:53,103 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:53,104 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:53,106 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:53,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 64 [2018-12-09 04:54:53,116 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 6 xjuncts. [2018-12-09 04:54:53,274 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 42 treesize of output 34 [2018-12-09 04:54:53,274 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:53,345 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:53,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-12-09 04:54:53,346 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:53,412 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 39 treesize of output 31 [2018-12-09 04:54:53,412 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:53,477 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:53,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 40 [2018-12-09 04:54:53,485 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 4 xjuncts. [2018-12-09 04:54:53,547 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:53,547 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:53,549 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:53,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 61 [2018-12-09 04:54:53,559 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 7 xjuncts. [2018-12-09 04:54:53,615 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:53,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-12-09 04:54:53,617 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:53,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 20 [2018-12-09 04:54:53,665 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:53,705 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:53,705 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:53,707 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 04:54:53,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2018-12-09 04:54:53,710 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 2 xjuncts. [2018-12-09 04:54:53,758 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-09 04:54:53,758 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:53,760 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-09 04:54:53,760 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-12-09 04:54:53,836 INFO L267 ElimStorePlain]: Start of recursive call 100: 13 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-09 04:54:53,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 11 xjuncts. [2018-12-09 04:54:53,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 11 xjuncts. [2018-12-09 04:54:53,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-12-09 04:54:53,973 INFO L202 ElimStorePlain]: Needed 112 recursive calls to eliminate 6 variables, input treesize:96, output treesize:191 [2018-12-09 04:54:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:54:54,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:54:54,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 43 [2018-12-09 04:54:54,197 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:54:54,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 04:54:54,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 04:54:54,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1645, Unknown=1, NotChecked=0, Total=1806 [2018-12-09 04:54:54,198 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 29 states. [2018-12-09 04:54:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:54:55,527 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-12-09 04:54:55,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 04:54:55,528 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2018-12-09 04:54:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:54:55,528 INFO L225 Difference]: With dead ends: 56 [2018-12-09 04:54:55,528 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 04:54:55,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=569, Invalid=3590, Unknown=1, NotChecked=0, Total=4160 [2018-12-09 04:54:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 04:54:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 04:54:55,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 04:54:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 04:54:55,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-12-09 04:54:55,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:54:55,530 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:54:55,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 04:54:55,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 04:54:55,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 04:54:55,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:54:55 BoogieIcfgContainer [2018-12-09 04:54:55,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 04:54:55,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:54:55,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:54:55,533 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:54:55,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:54:37" (3/4) ... [2018-12-09 04:54:55,535 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 04:54:55,539 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 04:54:55,539 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-09 04:54:55,539 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 04:54:55,542 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-09 04:54:55,542 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 04:54:55,542 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 04:54:55,567 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f4b5fba1-b7b9-4a18-a64c-b1d7dd6f22c7/bin-2019/utaipan/witness.graphml [2018-12-09 04:54:55,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:54:55,568 INFO L168 Benchmark]: Toolchain (without parser) took 18490.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.3 MB). Free memory was 950.6 MB in the beginning and 979.5 MB in the end (delta: -28.9 MB). Peak memory consumption was 204.4 MB. Max. memory is 11.5 GB. [2018-12-09 04:54:55,568 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:54:55,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-12-09 04:54:55,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:54:55,569 INFO L168 Benchmark]: Boogie Preprocessor took 17.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:54:55,569 INFO L168 Benchmark]: RCFGBuilder took 231.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 04:54:55,569 INFO L168 Benchmark]: TraceAbstraction took 17898.12 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.1 GB in the beginning and 987.9 MB in the end (delta: 70.3 MB). Peak memory consumption was 206.6 MB. Max. memory is 11.5 GB. [2018-12-09 04:54:55,569 INFO L168 Benchmark]: Witness Printer took 34.26 ms. Allocated memory is still 1.3 GB. Free memory was 987.9 MB in the beginning and 979.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2018-12-09 04:54:55,570 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 231.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17898.12 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.1 GB in the beginning and 987.9 MB in the end (delta: 70.3 MB). Peak memory consumption was 206.6 MB. Max. memory is 11.5 GB. * Witness Printer took 34.26 ms. Allocated memory is still 1.3 GB. Free memory was 987.9 MB in the beginning and 979.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 641]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 641]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 656]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 649]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 656]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 646]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 62 locations, 19 error locations. SAFE Result, 17.8s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 582 SDslu, 900 SDs, 0 SdLazy, 1449 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 310 ConstructedInterpolants, 49 QuantifiedInterpolants, 159136 SizeOfPredicates, 43 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 16/74 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...