./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b50a14aaadb91f0d2171e26e1cac3b7310be0682 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:33:55,279 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:33:55,280 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:33:55,288 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:33:55,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:33:55,289 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:33:55,289 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:33:55,291 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:33:55,292 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:33:55,292 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:33:55,293 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:33:55,293 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:33:55,294 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:33:55,294 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:33:55,295 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:33:55,295 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:33:55,296 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:33:55,296 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:33:55,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:33:55,298 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:33:55,299 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:33:55,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:33:55,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:33:55,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:33:55,301 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:33:55,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:33:55,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:33:55,303 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:33:55,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:33:55,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:33:55,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:33:55,305 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:33:55,305 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:33:55,305 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:33:55,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:33:55,306 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:33:55,306 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 13:33:55,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:33:55,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:33:55,315 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:33:55,315 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:33:55,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:33:55,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:33:55,316 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:33:55,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:33:55,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:33:55,316 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:33:55,317 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:33:55,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:33:55,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:33:55,317 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 13:33:55,317 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 13:33:55,317 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 13:33:55,318 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:33:55,318 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:33:55,318 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:33:55,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:33:55,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:33:55,318 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:33:55,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:33:55,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:33:55,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:33:55,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:33:55,319 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:33:55,319 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:33:55,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b50a14aaadb91f0d2171e26e1cac3b7310be0682 [2018-11-28 13:33:55,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:33:55,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:33:55,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:33:55,357 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:33:55,357 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:33:55,357 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-11-28 13:33:55,402 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/data/53727e54a/66d110acec0b4fe38ce5e95cddbb2c96/FLAG0ff2c3190 [2018-11-28 13:33:55,785 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:33:55,785 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-11-28 13:33:55,794 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/data/53727e54a/66d110acec0b4fe38ce5e95cddbb2c96/FLAG0ff2c3190 [2018-11-28 13:33:56,160 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/data/53727e54a/66d110acec0b4fe38ce5e95cddbb2c96 [2018-11-28 13:33:56,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:33:56,164 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 13:33:56,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:33:56,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:33:56,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:33:56,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:33:56" (1/1) ... [2018-11-28 13:33:56,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7843378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:33:56, skipping insertion in model container [2018-11-28 13:33:56,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:33:56" (1/1) ... [2018-11-28 13:33:56,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:33:56,198 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:33:56,381 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:33:56,392 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:33:56,467 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:33:56,499 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:33:56,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:33:56 WrapperNode [2018-11-28 13:33:56,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:33:56,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:33:56,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:33:56,500 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:33:56,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:33:56" (1/1) ... [2018-11-28 13:33:56,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:33:56" (1/1) ... [2018-11-28 13:33:56,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:33:56" (1/1) ... [2018-11-28 13:33:56,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:33:56" (1/1) ... [2018-11-28 13:33:56,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:33:56" (1/1) ... [2018-11-28 13:33:56,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:33:56" (1/1) ... [2018-11-28 13:33:56,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:33:56" (1/1) ... [2018-11-28 13:33:56,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:33:56,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:33:56,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:33:56,545 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:33:56,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:33:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/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-11-28 13:33:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:33:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:33:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 13:33:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 13:33:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-28 13:33:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-28 13:33:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2018-11-28 13:33:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2018-11-28 13:33:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:33:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 13:33:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 13:33:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 13:33:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 13:33:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 13:33:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 13:33:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 13:33:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 13:33:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 13:33:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 13:33:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 13:33:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 13:33:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 13:33:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 13:33:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 13:33:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 13:33:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 13:33:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 13:33:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 13:33:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 13:33:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 13:33:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 13:33:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 13:33:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 13:33:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 13:33:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 13:33:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 13:33:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 13:33:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 13:33:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 13:33:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 13:33:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 13:33:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 13:33:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 13:33:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 13:33:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 13:33:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 13:33:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 13:33:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 13:33:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 13:33:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 13:33:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 13:33:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 13:33:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 13:33:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 13:33:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 13:33:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 13:33:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 13:33:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 13:33:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 13:33:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 13:33:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 13:33:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 13:33:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 13:33:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 13:33:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 13:33:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 13:33:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 13:33:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 13:33:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 13:33:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 13:33:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 13:33:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 13:33:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 13:33:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 13:33:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 13:33:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 13:33:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 13:33:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 13:33:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 13:33:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 13:33:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 13:33:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 13:33:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 13:33:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 13:33:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 13:33:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 13:33:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 13:33:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 13:33:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 13:33:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 13:33:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 13:33:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 13:33:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 13:33:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 13:33:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 13:33:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 13:33:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 13:33:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 13:33:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 13:33:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 13:33:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 13:33:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 13:33:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 13:33:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 13:33:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 13:33:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 13:33:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 13:33:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 13:33:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 13:33:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 13:33:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 13:33:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 13:33:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 13:33:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-28 13:33:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-28 13:33:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:33:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:33:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2018-11-28 13:33:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:33:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:33:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:33:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2018-11-28 13:33:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:33:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:33:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:33:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:33:57,052 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:33:57,055 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-28 13:33:57,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:33:57 BoogieIcfgContainer [2018-11-28 13:33:57,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:33:57,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:33:57,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:33:57,058 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:33:57,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:33:56" (1/3) ... [2018-11-28 13:33:57,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52207a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:33:57, skipping insertion in model container [2018-11-28 13:33:57,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:33:56" (2/3) ... [2018-11-28 13:33:57,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52207a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:33:57, skipping insertion in model container [2018-11-28 13:33:57,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:33:57" (3/3) ... [2018-11-28 13:33:57,060 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-deref.i [2018-11-28 13:33:57,066 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:33:57,072 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-11-28 13:33:57,081 INFO L257 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2018-11-28 13:33:57,097 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:33:57,098 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:33:57,098 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 13:33:57,098 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:33:57,098 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:33:57,098 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:33:57,098 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:33:57,099 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:33:57,099 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:33:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2018-11-28 13:33:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:33:57,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:57,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:33:57,120 INFO L423 AbstractCegarLoop]: === Iteration 1 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:57,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:57,124 INFO L82 PathProgramCache]: Analyzing trace with hash -153905189, now seen corresponding path program 1 times [2018-11-28 13:33:57,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:57,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:57,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:57,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:57,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:33:57,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:33:57,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 13:33:57,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 13:33:57,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 13:33:57,223 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 2 states. [2018-11-28 13:33:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:33:57,240 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2018-11-28 13:33:57,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 13:33:57,242 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 13:33:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:33:57,249 INFO L225 Difference]: With dead ends: 150 [2018-11-28 13:33:57,249 INFO L226 Difference]: Without dead ends: 143 [2018-11-28 13:33:57,250 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-11-28 13:33:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-28 13:33:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-11-28 13:33:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-28 13:33:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-11-28 13:33:57,275 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 10 [2018-11-28 13:33:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:33:57,275 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-11-28 13:33:57,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 13:33:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-11-28 13:33:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 13:33:57,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:57,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:33:57,276 INFO L423 AbstractCegarLoop]: === Iteration 2 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:57,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:57,276 INFO L82 PathProgramCache]: Analyzing trace with hash -477114141, now seen corresponding path program 1 times [2018-11-28 13:33:57,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:57,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:57,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:57,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:57,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:33:57,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:33:57,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:33:57,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:33:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:33:57,328 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 3 states. [2018-11-28 13:33:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:33:57,421 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-11-28 13:33:57,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:33:57,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 13:33:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:33:57,423 INFO L225 Difference]: With dead ends: 146 [2018-11-28 13:33:57,423 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 13:33:57,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:33:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 13:33:57,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-28 13:33:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-28 13:33:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-11-28 13:33:57,432 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 11 [2018-11-28 13:33:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:33:57,433 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-11-28 13:33:57,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:33:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-11-28 13:33:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 13:33:57,433 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:57,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:33:57,434 INFO L423 AbstractCegarLoop]: === Iteration 3 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:57,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:57,434 INFO L82 PathProgramCache]: Analyzing trace with hash -477113242, now seen corresponding path program 1 times [2018-11-28 13:33:57,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:57,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:57,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:57,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:57,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:33:57,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:33:57,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:33:57,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:33:57,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:33:57,478 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 3 states. [2018-11-28 13:33:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:33:57,613 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2018-11-28 13:33:57,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:33:57,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 13:33:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:33:57,616 INFO L225 Difference]: With dead ends: 144 [2018-11-28 13:33:57,616 INFO L226 Difference]: Without dead ends: 144 [2018-11-28 13:33:57,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:33:57,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-28 13:33:57,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-11-28 13:33:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-28 13:33:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2018-11-28 13:33:57,625 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 11 [2018-11-28 13:33:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:33:57,625 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2018-11-28 13:33:57,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:33:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2018-11-28 13:33:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 13:33:57,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:57,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:33:57,626 INFO L423 AbstractCegarLoop]: === Iteration 4 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:57,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:57,627 INFO L82 PathProgramCache]: Analyzing trace with hash -477113241, now seen corresponding path program 1 times [2018-11-28 13:33:57,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:57,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:57,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:57,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:57,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:33:57,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:33:57,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:33:57,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:33:57,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:33:57,671 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand 3 states. [2018-11-28 13:33:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:33:57,780 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-11-28 13:33:57,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:33:57,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 13:33:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:33:57,781 INFO L225 Difference]: With dead ends: 163 [2018-11-28 13:33:57,781 INFO L226 Difference]: Without dead ends: 163 [2018-11-28 13:33:57,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:33:57,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-28 13:33:57,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-11-28 13:33:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-28 13:33:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 170 transitions. [2018-11-28 13:33:57,790 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 170 transitions. Word has length 11 [2018-11-28 13:33:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:33:57,790 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 170 transitions. [2018-11-28 13:33:57,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:33:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 170 transitions. [2018-11-28 13:33:57,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 13:33:57,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:57,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:33:57,791 INFO L423 AbstractCegarLoop]: === Iteration 5 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:57,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:57,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1633802846, now seen corresponding path program 1 times [2018-11-28 13:33:57,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:57,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:57,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:57,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:57,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:33:57,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:33:57,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:33:57,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:33:57,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:33:57,821 INFO L87 Difference]: Start difference. First operand 151 states and 170 transitions. Second operand 3 states. [2018-11-28 13:33:57,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:33:57,836 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2018-11-28 13:33:57,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:33:57,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-28 13:33:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:33:57,837 INFO L225 Difference]: With dead ends: 161 [2018-11-28 13:33:57,837 INFO L226 Difference]: Without dead ends: 161 [2018-11-28 13:33:57,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:33:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-28 13:33:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2018-11-28 13:33:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-28 13:33:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2018-11-28 13:33:57,843 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 14 [2018-11-28 13:33:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:33:57,843 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2018-11-28 13:33:57,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:33:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2018-11-28 13:33:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 13:33:57,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:57,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:33:57,845 INFO L423 AbstractCegarLoop]: === Iteration 6 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:57,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:57,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1464839699, now seen corresponding path program 1 times [2018-11-28 13:33:57,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:57,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:57,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:57,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:33:57,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:33:57,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:33:57,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:33:57,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:33:57,862 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand 3 states. [2018-11-28 13:33:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:33:57,956 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2018-11-28 13:33:57,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:33:57,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-28 13:33:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:33:57,958 INFO L225 Difference]: With dead ends: 195 [2018-11-28 13:33:57,958 INFO L226 Difference]: Without dead ends: 194 [2018-11-28 13:33:57,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:33:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-28 13:33:57,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 160. [2018-11-28 13:33:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-28 13:33:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2018-11-28 13:33:57,969 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 16 [2018-11-28 13:33:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:33:57,970 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2018-11-28 13:33:57,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:33:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2018-11-28 13:33:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 13:33:57,970 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:57,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:33:57,971 INFO L423 AbstractCegarLoop]: === Iteration 7 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:57,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:57,971 INFO L82 PathProgramCache]: Analyzing trace with hash -316129894, now seen corresponding path program 1 times [2018-11-28 13:33:57,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:57,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:57,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:57,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:58,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:58,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:33:58,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:33:58,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:33:58,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:33:58,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:33:58,019 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand 6 states. [2018-11-28 13:33:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:33:58,042 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2018-11-28 13:33:58,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:33:58,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 13:33:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:33:58,043 INFO L225 Difference]: With dead ends: 165 [2018-11-28 13:33:58,043 INFO L226 Difference]: Without dead ends: 159 [2018-11-28 13:33:58,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:33:58,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-28 13:33:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 154. [2018-11-28 13:33:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-28 13:33:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2018-11-28 13:33:58,047 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 21 [2018-11-28 13:33:58,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:33:58,047 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2018-11-28 13:33:58,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:33:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2018-11-28 13:33:58,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:33:58,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:58,048 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, 1, 1] [2018-11-28 13:33:58,049 INFO L423 AbstractCegarLoop]: === Iteration 8 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:58,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:58,049 INFO L82 PathProgramCache]: Analyzing trace with hash 99516259, now seen corresponding path program 1 times [2018-11-28 13:33:58,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:58,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:58,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:58,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:58,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:33:58,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:33:58,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:33:58,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:33:58,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:33:58,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:33:58,092 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand 5 states. [2018-11-28 13:33:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:33:58,233 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2018-11-28 13:33:58,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:33:58,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-28 13:33:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:33:58,234 INFO L225 Difference]: With dead ends: 156 [2018-11-28 13:33:58,234 INFO L226 Difference]: Without dead ends: 156 [2018-11-28 13:33:58,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:33:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-28 13:33:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2018-11-28 13:33:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-28 13:33:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2018-11-28 13:33:58,238 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 23 [2018-11-28 13:33:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:33:58,238 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2018-11-28 13:33:58,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:33:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2018-11-28 13:33:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:33:58,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:58,238 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, 1, 1] [2018-11-28 13:33:58,239 INFO L423 AbstractCegarLoop]: === Iteration 9 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:58,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:58,239 INFO L82 PathProgramCache]: Analyzing trace with hash 99516260, now seen corresponding path program 1 times [2018-11-28 13:33:58,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:58,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:58,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:33:58,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:33:58,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:33:58,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:33:58,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:33:58,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:33:58,308 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand 5 states. [2018-11-28 13:33:58,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:33:58,449 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2018-11-28 13:33:58,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:33:58,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-28 13:33:58,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:33:58,450 INFO L225 Difference]: With dead ends: 155 [2018-11-28 13:33:58,450 INFO L226 Difference]: Without dead ends: 155 [2018-11-28 13:33:58,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:33:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-28 13:33:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-11-28 13:33:58,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-28 13:33:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2018-11-28 13:33:58,453 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 23 [2018-11-28 13:33:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:33:58,454 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2018-11-28 13:33:58,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:33:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2018-11-28 13:33:58,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:33:58,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:58,454 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:33:58,454 INFO L423 AbstractCegarLoop]: === Iteration 10 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:58,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:58,454 INFO L82 PathProgramCache]: Analyzing trace with hash 126263707, now seen corresponding path program 1 times [2018-11-28 13:33:58,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:58,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:58,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:58,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:58,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:58,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:33:58,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:33:58,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:58,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:33:58,579 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-11-28 13:33:58,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:33:58,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:33:58,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:33:58,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:33:58,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:33:58,602 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-11-28 13:33:58,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:33:58,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:33:58,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-11-28 13:33:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:58,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:33:58,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 13:33:58,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:33:58,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:33:58,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:33:58,642 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 6 states. [2018-11-28 13:33:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:33:58,815 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2018-11-28 13:33:58,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:33:58,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-28 13:33:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:33:58,817 INFO L225 Difference]: With dead ends: 163 [2018-11-28 13:33:58,817 INFO L226 Difference]: Without dead ends: 163 [2018-11-28 13:33:58,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:33:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-28 13:33:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-11-28 13:33:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-28 13:33:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 167 transitions. [2018-11-28 13:33:58,821 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 167 transitions. Word has length 23 [2018-11-28 13:33:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:33:58,821 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 167 transitions. [2018-11-28 13:33:58,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:33:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 167 transitions. [2018-11-28 13:33:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:33:58,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:58,822 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:33:58,822 INFO L423 AbstractCegarLoop]: === Iteration 11 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:58,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:58,823 INFO L82 PathProgramCache]: Analyzing trace with hash 126263708, now seen corresponding path program 1 times [2018-11-28 13:33:58,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:58,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:58,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:58,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:58,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:58,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:33:58,894 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:33:58,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:58,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:33:58,942 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-11-28 13:33:58,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:33:58,950 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-11-28 13:33:58,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:33:58,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:33:58,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 13:33:58,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:33:59,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:33:59,002 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-11-28 13:33:59,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:33:59,011 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 12 treesize of output 15 [2018-11-28 13:33:59,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:33:59,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:33:59,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-11-28 13:33:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:59,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:33:59,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 7 [2018-11-28 13:33:59,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:33:59,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:33:59,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:33:59,047 INFO L87 Difference]: Start difference. First operand 151 states and 167 transitions. Second operand 8 states. [2018-11-28 13:33:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:33:59,366 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2018-11-28 13:33:59,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:33:59,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-28 13:33:59,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:33:59,367 INFO L225 Difference]: With dead ends: 169 [2018-11-28 13:33:59,368 INFO L226 Difference]: Without dead ends: 169 [2018-11-28 13:33:59,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:33:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-28 13:33:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 150. [2018-11-28 13:33:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-28 13:33:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 166 transitions. [2018-11-28 13:33:59,371 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 166 transitions. Word has length 23 [2018-11-28 13:33:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:33:59,371 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 166 transitions. [2018-11-28 13:33:59,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:33:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 166 transitions. [2018-11-28 13:33:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 13:33:59,372 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:59,372 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, 1, 1, 1, 1] [2018-11-28 13:33:59,372 INFO L423 AbstractCegarLoop]: === Iteration 12 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:59,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:59,372 INFO L82 PathProgramCache]: Analyzing trace with hash 671682508, now seen corresponding path program 1 times [2018-11-28 13:33:59,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:59,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:59,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:59,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:33:59,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:33:59,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:33:59,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:33:59,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:33:59,395 INFO L87 Difference]: Start difference. First operand 150 states and 166 transitions. Second operand 3 states. [2018-11-28 13:33:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:33:59,428 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2018-11-28 13:33:59,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:33:59,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 13:33:59,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:33:59,429 INFO L225 Difference]: With dead ends: 157 [2018-11-28 13:33:59,429 INFO L226 Difference]: Without dead ends: 157 [2018-11-28 13:33:59,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:33:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-28 13:33:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2018-11-28 13:33:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-28 13:33:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2018-11-28 13:33:59,432 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 25 [2018-11-28 13:33:59,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:33:59,432 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2018-11-28 13:33:59,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:33:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2018-11-28 13:33:59,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 13:33:59,433 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:59,433 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, 1, 1, 1, 1, 1] [2018-11-28 13:33:59,433 INFO L423 AbstractCegarLoop]: === Iteration 13 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:59,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1161487314, now seen corresponding path program 1 times [2018-11-28 13:33:59,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:59,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:59,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:59,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:59,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:59,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:33:59,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:33:59,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:33:59,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:33:59,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:33:59,513 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 8 states. [2018-11-28 13:33:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:33:59,769 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2018-11-28 13:33:59,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:33:59,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-28 13:33:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:33:59,770 INFO L225 Difference]: With dead ends: 156 [2018-11-28 13:33:59,770 INFO L226 Difference]: Without dead ends: 156 [2018-11-28 13:33:59,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:33:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-28 13:33:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2018-11-28 13:33:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-28 13:33:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2018-11-28 13:33:59,772 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 26 [2018-11-28 13:33:59,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:33:59,773 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2018-11-28 13:33:59,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:33:59,773 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2018-11-28 13:33:59,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 13:33:59,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:33:59,773 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, 1, 1, 1, 1, 1] [2018-11-28 13:33:59,774 INFO L423 AbstractCegarLoop]: === Iteration 14 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:33:59,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:33:59,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1161487315, now seen corresponding path program 1 times [2018-11-28 13:33:59,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:33:59,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:33:59,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:59,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:33:59,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:33:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:33:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:33:59,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:33:59,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:33:59,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:33:59,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:33:59,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:33:59,871 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand 8 states. [2018-11-28 13:34:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:00,136 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2018-11-28 13:34:00,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:34:00,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-28 13:34:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:34:00,138 INFO L225 Difference]: With dead ends: 155 [2018-11-28 13:34:00,138 INFO L226 Difference]: Without dead ends: 155 [2018-11-28 13:34:00,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:34:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-28 13:34:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2018-11-28 13:34:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-28 13:34:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2018-11-28 13:34:00,141 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 26 [2018-11-28 13:34:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:34:00,141 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2018-11-28 13:34:00,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:34:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2018-11-28 13:34:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 13:34:00,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:34:00,142 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:34:00,142 INFO L423 AbstractCegarLoop]: === Iteration 15 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:34:00,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1612091434, now seen corresponding path program 1 times [2018-11-28 13:34:00,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:00,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:00,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:00,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:00,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:00,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:34:00,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:34:00,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:34:00,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:34:00,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:34:00,210 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand 9 states. [2018-11-28 13:34:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:00,388 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-11-28 13:34:00,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:34:00,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-28 13:34:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:34:00,389 INFO L225 Difference]: With dead ends: 154 [2018-11-28 13:34:00,389 INFO L226 Difference]: Without dead ends: 154 [2018-11-28 13:34:00,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:34:00,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-28 13:34:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2018-11-28 13:34:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-28 13:34:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2018-11-28 13:34:00,392 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 29 [2018-11-28 13:34:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:34:00,392 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2018-11-28 13:34:00,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:34:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2018-11-28 13:34:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 13:34:00,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:34:00,393 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:34:00,393 INFO L423 AbstractCegarLoop]: === Iteration 16 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:34:00,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:00,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1612091435, now seen corresponding path program 1 times [2018-11-28 13:34:00,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:00,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:00,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:00,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:00,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:00,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:34:00,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:34:00,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:34:00,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:34:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:34:00,519 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 9 states. [2018-11-28 13:34:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:00,740 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-11-28 13:34:00,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:34:00,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-28 13:34:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:34:00,742 INFO L225 Difference]: With dead ends: 153 [2018-11-28 13:34:00,742 INFO L226 Difference]: Without dead ends: 153 [2018-11-28 13:34:00,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:34:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-28 13:34:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2018-11-28 13:34:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-28 13:34:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2018-11-28 13:34:00,745 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 161 transitions. Word has length 29 [2018-11-28 13:34:00,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:34:00,745 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 161 transitions. [2018-11-28 13:34:00,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:34:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 161 transitions. [2018-11-28 13:34:00,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 13:34:00,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:34:00,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:34:00,746 INFO L423 AbstractCegarLoop]: === Iteration 17 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:34:00,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:00,746 INFO L82 PathProgramCache]: Analyzing trace with hash -508329991, now seen corresponding path program 1 times [2018-11-28 13:34:00,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:00,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:00,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:00,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:00,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:00,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:34:00,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:34:00,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:34:00,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:34:00,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:34:00,853 INFO L87 Difference]: Start difference. First operand 150 states and 161 transitions. Second operand 10 states. [2018-11-28 13:34:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:01,072 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2018-11-28 13:34:01,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:34:01,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-28 13:34:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:34:01,073 INFO L225 Difference]: With dead ends: 152 [2018-11-28 13:34:01,074 INFO L226 Difference]: Without dead ends: 152 [2018-11-28 13:34:01,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:34:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-28 13:34:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-11-28 13:34:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-28 13:34:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-11-28 13:34:01,077 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 32 [2018-11-28 13:34:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:34:01,077 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-11-28 13:34:01,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:34:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-11-28 13:34:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 13:34:01,078 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:34:01,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:34:01,078 INFO L423 AbstractCegarLoop]: === Iteration 18 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:34:01,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:01,078 INFO L82 PathProgramCache]: Analyzing trace with hash -508329990, now seen corresponding path program 1 times [2018-11-28 13:34:01,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:01,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:01,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:01,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:01,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:01,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:34:01,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:34:01,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:34:01,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:34:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:34:01,225 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 10 states. [2018-11-28 13:34:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:01,524 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-11-28 13:34:01,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:34:01,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-28 13:34:01,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:34:01,525 INFO L225 Difference]: With dead ends: 151 [2018-11-28 13:34:01,525 INFO L226 Difference]: Without dead ends: 151 [2018-11-28 13:34:01,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:34:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-28 13:34:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-11-28 13:34:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-28 13:34:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-11-28 13:34:01,529 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 32 [2018-11-28 13:34:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:34:01,529 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-11-28 13:34:01,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:34:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-11-28 13:34:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 13:34:01,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:34:01,530 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:34:01,530 INFO L423 AbstractCegarLoop]: === Iteration 19 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:34:01,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:01,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1701515022, now seen corresponding path program 1 times [2018-11-28 13:34:01,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:01,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:01,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:01,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:01,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:01,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:34:01,767 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:34:01,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:01,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:34:01,821 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-11-28 13:34:01,823 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 10 treesize of output 9 [2018-11-28 13:34:01,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,834 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-11-28 13:34:01,836 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 10 treesize of output 9 [2018-11-28 13:34:01,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,837 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-11-28 13:34:01,850 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 29 treesize of output 24 [2018-11-28 13:34:01,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:01,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 24 treesize of output 18 [2018-11-28 13:34:01,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,866 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 29 treesize of output 24 [2018-11-28 13:34:01,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:01,870 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 24 treesize of output 18 [2018-11-28 13:34:01,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:24 [2018-11-28 13:34:01,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:01,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:01,883 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-11-28 13:34:01,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-11-28 13:34:01,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-28 13:34:01,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:01,905 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 16 treesize of output 23 [2018-11-28 13:34:01,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-28 13:34:01,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:01,925 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 16 treesize of output 23 [2018-11-28 13:34:01,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,935 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:27 [2018-11-28 13:34:01,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-11-28 13:34:01,977 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 11 [2018-11-28 13:34:01,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:01,998 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 29 treesize of output 30 [2018-11-28 13:34:02,000 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 11 [2018-11-28 13:34:02,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:02,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:02,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:34:02,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:49 [2018-11-28 13:34:02,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-11-28 13:34:02,074 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:34:02,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:02,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:02,095 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 42 treesize of output 37 [2018-11-28 13:34:02,101 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:34:02,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:02,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:02,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:34:02,114 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:75 [2018-11-28 13:34:08,150 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2018-11-28 13:34:08,187 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 54 treesize of output 49 [2018-11-28 13:34:08,195 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 13:34:08,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:34:08,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:34:08,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 68 [2018-11-28 13:34:08,222 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:34:08,223 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-28 13:34:08,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:08,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:08,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 74 [2018-11-28 13:34:08,242 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 13:34:08,243 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 13:34:08,259 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:34:08,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:34:08,276 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:115, output treesize:81 [2018-11-28 13:34:08,310 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 31 treesize of output 32 [2018-11-28 13:34:08,312 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 14 treesize of output 13 [2018-11-28 13:34:08,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:08,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:08,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-11-28 13:34:08,329 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 14 treesize of output 13 [2018-11-28 13:34:08,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:08,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:08,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:34:08,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-11-28 13:34:08,392 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-11-28 13:34:08,394 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-11-28 13:34:08,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:08,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:08,423 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 32 treesize of output 23 [2018-11-28 13:34:08,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:34:08,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:34:08,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-28 13:34:08,440 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 15 treesize of output 3 [2018-11-28 13:34:08,441 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:08,448 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-11-28 13:34:08,449 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:08,451 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:08,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:08,454 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:7 [2018-11-28 13:34:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:08,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:34:08,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 22 [2018-11-28 13:34:08,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 13:34:08,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 13:34:08,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=384, Unknown=2, NotChecked=0, Total=462 [2018-11-28 13:34:08,485 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 22 states. [2018-11-28 13:34:23,161 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-11-28 13:34:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:29,577 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2018-11-28 13:34:29,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 13:34:29,577 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-11-28 13:34:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:34:29,578 INFO L225 Difference]: With dead ends: 176 [2018-11-28 13:34:29,578 INFO L226 Difference]: Without dead ends: 176 [2018-11-28 13:34:29,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=236, Invalid=1161, Unknown=9, NotChecked=0, Total=1406 [2018-11-28 13:34:29,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-28 13:34:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2018-11-28 13:34:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-28 13:34:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2018-11-28 13:34:29,582 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 37 [2018-11-28 13:34:29,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:34:29,582 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2018-11-28 13:34:29,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 13:34:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2018-11-28 13:34:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 13:34:29,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:34:29,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:34:29,583 INFO L423 AbstractCegarLoop]: === Iteration 20 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:34:29,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:29,583 INFO L82 PathProgramCache]: Analyzing trace with hash -266911900, now seen corresponding path program 1 times [2018-11-28 13:34:29,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:29,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:29,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:29,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:29,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:34:29,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:34:29,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:34:29,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:34:29,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:34:29,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:34:29,636 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand 7 states. [2018-11-28 13:34:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:29,746 INFO L93 Difference]: Finished difference Result 174 states and 182 transitions. [2018-11-28 13:34:29,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:34:29,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-28 13:34:29,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:34:29,747 INFO L225 Difference]: With dead ends: 174 [2018-11-28 13:34:29,747 INFO L226 Difference]: Without dead ends: 174 [2018-11-28 13:34:29,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:34:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-28 13:34:29,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-11-28 13:34:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-28 13:34:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 181 transitions. [2018-11-28 13:34:29,751 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 181 transitions. Word has length 42 [2018-11-28 13:34:29,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:34:29,751 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 181 transitions. [2018-11-28 13:34:29,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:34:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 181 transitions. [2018-11-28 13:34:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:34:29,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:34:29,752 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, 1, 1, 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-11-28 13:34:29,752 INFO L423 AbstractCegarLoop]: === Iteration 21 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:34:29,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:29,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1314138391, now seen corresponding path program 1 times [2018-11-28 13:34:29,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:29,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:29,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:29,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:34:29,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:34:29,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:29,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:34:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:29,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:34:29,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-11-28 13:34:29,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:34:29,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:34:29,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:34:29,916 INFO L87 Difference]: Start difference. First operand 173 states and 181 transitions. Second operand 10 states. [2018-11-28 13:34:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:30,183 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2018-11-28 13:34:30,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:34:30,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-28 13:34:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:34:30,185 INFO L225 Difference]: With dead ends: 176 [2018-11-28 13:34:30,185 INFO L226 Difference]: Without dead ends: 176 [2018-11-28 13:34:30,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:34:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-28 13:34:30,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2018-11-28 13:34:30,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-28 13:34:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 182 transitions. [2018-11-28 13:34:30,189 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 182 transitions. Word has length 47 [2018-11-28 13:34:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:34:30,189 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 182 transitions. [2018-11-28 13:34:30,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:34:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 182 transitions. [2018-11-28 13:34:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:34:30,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:34:30,190 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, 1, 1, 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-11-28 13:34:30,191 INFO L423 AbstractCegarLoop]: === Iteration 22 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:34:30,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:30,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1314138390, now seen corresponding path program 1 times [2018-11-28 13:34:30,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:30,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:30,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:30,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:30,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:30,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:34:30,283 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:34:30,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:30,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:34:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:30,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:34:30,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-11-28 13:34:30,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:34:30,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:34:30,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:34:30,410 INFO L87 Difference]: Start difference. First operand 172 states and 182 transitions. Second operand 11 states. [2018-11-28 13:34:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:30,762 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-11-28 13:34:30,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:34:30,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-11-28 13:34:30,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:34:30,766 INFO L225 Difference]: With dead ends: 189 [2018-11-28 13:34:30,766 INFO L226 Difference]: Without dead ends: 189 [2018-11-28 13:34:30,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:34:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-28 13:34:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 174. [2018-11-28 13:34:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-28 13:34:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2018-11-28 13:34:30,770 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 184 transitions. Word has length 47 [2018-11-28 13:34:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:34:30,770 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 184 transitions. [2018-11-28 13:34:30,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:34:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2018-11-28 13:34:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:34:30,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:34:30,771 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:34:30,771 INFO L423 AbstractCegarLoop]: === Iteration 23 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:34:30,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:30,771 INFO L82 PathProgramCache]: Analyzing trace with hash 245714365, now seen corresponding path program 1 times [2018-11-28 13:34:30,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:30,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:30,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:30,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:30,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:31,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:34:31,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:34:31,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:31,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:34:31,061 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-11-28 13:34:31,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:34:31,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:31,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:31,075 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-11-28 13:34:31,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-28 13:34:31,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 13:34:31,084 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-11-28 13:34:31,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-28 13:34:31,124 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 23 treesize of output 24 [2018-11-28 13:34:31,141 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-11-28 13:34:31,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:34:31,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:42 [2018-11-28 13:34:31,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-11-28 13:34:31,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:31,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-11-28 13:34:31,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,214 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-11-28 13:34:31,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:42 [2018-11-28 13:34:31,221 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:31,225 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:31,226 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:31,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 52 [2018-11-28 13:34:31,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:34:31,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:61 [2018-11-28 13:34:31,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-11-28 13:34:31,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:31,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-11-28 13:34:31,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:34:31,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:73 [2018-11-28 13:34:31,344 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 87 treesize of output 86 [2018-11-28 13:34:31,346 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 11 [2018-11-28 13:34:31,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,367 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-11-28 13:34:31,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:84 [2018-11-28 13:34:31,435 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 100 treesize of output 93 [2018-11-28 13:34:31,438 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:34:31,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:31,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:34:31,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:105, output treesize:97 [2018-11-28 13:34:37,501 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2018-11-28 13:34:37,548 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 112 treesize of output 105 [2018-11-28 13:34:37,572 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 13:34:37,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:34:37,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:34:37,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 13:34:37,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:160 [2018-11-28 13:34:37,685 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 89 treesize of output 88 [2018-11-28 13:34:37,687 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 14 treesize of output 13 [2018-11-28 13:34:37,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:37,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:37,703 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-11-28 13:34:37,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:86 [2018-11-28 13:34:37,746 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 90 treesize of output 67 [2018-11-28 13:34:37,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 29 [2018-11-28 13:34:37,750 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:34:37,775 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-11-28 13:34:37,775 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:37,782 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-11-28 13:34:37,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:37,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:34:37,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:34:37,796 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:28 [2018-11-28 13:34:37,845 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-11-28 13:34:37,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:37,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:34:37,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:33 [2018-11-28 13:34:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:37,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:34:37,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 27 [2018-11-28 13:34:37,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-28 13:34:37,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 13:34:37,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=611, Unknown=2, NotChecked=0, Total=756 [2018-11-28 13:34:37,901 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. Second operand 28 states. [2018-11-28 13:34:53,021 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-11-28 13:34:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:34:59,514 INFO L93 Difference]: Finished difference Result 218 states and 230 transitions. [2018-11-28 13:34:59,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 13:34:59,514 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2018-11-28 13:34:59,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:34:59,515 INFO L225 Difference]: With dead ends: 218 [2018-11-28 13:34:59,515 INFO L226 Difference]: Without dead ends: 218 [2018-11-28 13:34:59,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=548, Invalid=2199, Unknown=9, NotChecked=0, Total=2756 [2018-11-28 13:34:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-28 13:34:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 177. [2018-11-28 13:34:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-28 13:34:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-11-28 13:34:59,518 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 47 [2018-11-28 13:34:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:34:59,518 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-11-28 13:34:59,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-28 13:34:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-11-28 13:34:59,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:34:59,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:34:59,518 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:34:59,519 INFO L423 AbstractCegarLoop]: === Iteration 24 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:34:59,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:34:59,519 INFO L82 PathProgramCache]: Analyzing trace with hash 245714366, now seen corresponding path program 1 times [2018-11-28 13:34:59,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:34:59,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:34:59,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:59,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:59,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:34:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:34:59,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:34:59,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:34:59,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:34:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:34:59,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:34:59,963 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-11-28 13:34:59,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:59,968 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-11-28 13:34:59,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:34:59,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:34:59,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 13:34:59,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:34:59,994 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 12 treesize of output 15 [2018-11-28 13:34:59,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:00,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:00,006 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-11-28 13:35:00,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-11-28 13:35:00,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 13:35:00,057 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 10 treesize of output 9 [2018-11-28 13:35:00,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 13:35:00,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-28 13:35:00,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-11-28 13:35:00,113 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 33 treesize of output 34 [2018-11-28 13:35:00,115 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 14 treesize of output 13 [2018-11-28 13:35:00,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-11-28 13:35:00,133 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 14 treesize of output 13 [2018-11-28 13:35:00,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:78 [2018-11-28 13:35:00,178 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 42 treesize of output 47 [2018-11-28 13:35:00,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:00,181 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 24 treesize of output 18 [2018-11-28 13:35:00,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 68 [2018-11-28 13:35:00,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:00,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-11-28 13:35:00,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:78 [2018-11-28 13:35:00,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:00,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:00,230 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 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-28 13:35:00,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:00,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:00,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:00,251 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-11-28 13:35:00,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:81 [2018-11-28 13:35:00,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2018-11-28 13:35:00,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:00,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 71 [2018-11-28 13:35:00,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-11-28 13:35:00,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:00,351 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 16 treesize of output 23 [2018-11-28 13:35:00,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,374 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:93 [2018-11-28 13:35:00,461 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 117 treesize of output 116 [2018-11-28 13:35:00,463 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 11 [2018-11-28 13:35:00,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,499 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 67 [2018-11-28 13:35:00,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 12 treesize of output 11 [2018-11-28 13:35:00,502 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:35:00,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:131, output treesize:115 [2018-11-28 13:35:00,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 143 treesize of output 136 [2018-11-28 13:35:00,628 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:35:00,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,666 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 74 [2018-11-28 13:35:00,668 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:35:00,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:00,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:35:00,691 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:141 [2018-11-28 13:35:06,753 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-11-28 13:35:06,810 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 167 treesize of output 160 [2018-11-28 13:35:06,819 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 13:35:06,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:35:06,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:35:06,881 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 126 [2018-11-28 13:35:06,883 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:35:06,884 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-28 13:35:06,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:06,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:06,903 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 132 [2018-11-28 13:35:06,911 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 13:35:06,911 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 13:35:06,924 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:35:06,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:35:06,958 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:181, output treesize:213 [2018-11-28 13:35:07,029 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 121 treesize of output 120 [2018-11-28 13:35:07,031 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 14 treesize of output 13 [2018-11-28 13:35:07,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:07,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:07,062 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 69 [2018-11-28 13:35:07,064 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 14 treesize of output 13 [2018-11-28 13:35:07,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:07,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:07,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:35:07,090 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:135, output treesize:119 [2018-11-28 13:35:07,148 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 114 treesize of output 87 [2018-11-28 13:35:07,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:35:07,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:07,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 13:35:07,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:07,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 45 [2018-11-28 13:35:07,179 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:35:07,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:35:07,200 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-11-28 13:35:07,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:35:07,202 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:07,208 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-11-28 13:35:07,208 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:07,212 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 15 treesize of output 3 [2018-11-28 13:35:07,212 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:07,213 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:07,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:35:07,219 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:137, output treesize:31 [2018-11-28 13:35:07,280 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-11-28 13:35:07,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:07,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:35:07,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 [2018-11-28 13:35:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:07,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:35:07,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2018-11-28 13:35:07,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 13:35:07,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 13:35:07,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=930, Unknown=2, NotChecked=0, Total=1056 [2018-11-28 13:35:07,347 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 33 states. [2018-11-28 13:35:10,201 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2018-11-28 13:35:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:10,998 INFO L93 Difference]: Finished difference Result 212 states and 224 transitions. [2018-11-28 13:35:10,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 13:35:10,999 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-11-28 13:35:10,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:11,000 INFO L225 Difference]: With dead ends: 212 [2018-11-28 13:35:11,000 INFO L226 Difference]: Without dead ends: 212 [2018-11-28 13:35:11,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 31 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=567, Invalid=2623, Unknown=2, NotChecked=0, Total=3192 [2018-11-28 13:35:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-28 13:35:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 191. [2018-11-28 13:35:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-28 13:35:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 208 transitions. [2018-11-28 13:35:11,002 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 208 transitions. Word has length 47 [2018-11-28 13:35:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:11,003 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 208 transitions. [2018-11-28 13:35:11,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 13:35:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 208 transitions. [2018-11-28 13:35:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 13:35:11,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:11,003 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, 1, 1, 1, 1, 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-11-28 13:35:11,003 INFO L423 AbstractCegarLoop]: === Iteration 25 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:35:11,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:11,003 INFO L82 PathProgramCache]: Analyzing trace with hash -166604338, now seen corresponding path program 1 times [2018-11-28 13:35:11,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:11,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:11,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:11,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:11,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:11,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:35:11,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:35:11,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:11,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:35:11,149 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-11-28 13:35:11,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:11,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:11,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:35:12,235 WARN L180 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-11-28 13:35:12,580 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 13:35:12,594 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 40 [2018-11-28 13:35:12,597 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 32 treesize of output 31 [2018-11-28 13:35:12,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:12,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:12,625 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-11-28 13:35:12,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:46 [2018-11-28 13:35:12,965 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 13:35:13,313 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 13:35:13,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:13,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-28 13:35:13,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:13,337 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 18 treesize of output 12 [2018-11-28 13:35:13,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:13,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:13,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:13,342 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 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-28 13:35:13,342 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:13,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:13,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:35:13,354 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-11-28 13:35:13,465 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 29 treesize of output 27 [2018-11-28 13:35:13,471 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 1 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 13:35:13,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:35:13,483 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 12 [2018-11-28 13:35:13,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:13,508 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 12 treesize of output 4 [2018-11-28 13:35:13,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:13,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:13,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:13,516 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:4 [2018-11-28 13:35:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:13,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:35:13,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 26 [2018-11-28 13:35:13,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 13:35:13,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 13:35:13,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2018-11-28 13:35:13,562 INFO L87 Difference]: Start difference. First operand 191 states and 208 transitions. Second operand 26 states. [2018-11-28 13:35:15,999 WARN L180 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2018-11-28 13:35:19,315 WARN L180 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-11-28 13:35:20,386 WARN L180 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2018-11-28 13:35:21,478 WARN L180 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2018-11-28 13:35:23,098 WARN L180 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-11-28 13:35:26,892 WARN L180 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-11-28 13:35:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:31,257 INFO L93 Difference]: Finished difference Result 283 states and 305 transitions. [2018-11-28 13:35:31,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 13:35:31,257 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-11-28 13:35:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:31,258 INFO L225 Difference]: With dead ends: 283 [2018-11-28 13:35:31,258 INFO L226 Difference]: Without dead ends: 283 [2018-11-28 13:35:31,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=252, Invalid=2000, Unknown=4, NotChecked=0, Total=2256 [2018-11-28 13:35:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-28 13:35:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2018-11-28 13:35:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-28 13:35:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 262 transitions. [2018-11-28 13:35:31,263 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 262 transitions. Word has length 49 [2018-11-28 13:35:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:31,263 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 262 transitions. [2018-11-28 13:35:31,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 13:35:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 262 transitions. [2018-11-28 13:35:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:35:31,264 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:31,264 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, 1, 1, 1, 1, 1, 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-11-28 13:35:31,264 INFO L423 AbstractCegarLoop]: === Iteration 26 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:35:31,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:31,264 INFO L82 PathProgramCache]: Analyzing trace with hash -869791894, now seen corresponding path program 1 times [2018-11-28 13:35:31,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:31,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:31,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:31,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:31,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:31,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:35:31,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:35:31,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:31,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:35:31,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:31,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:31,478 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-11-28 13:35:31,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:31,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:31,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-28 13:35:31,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 13:35:31,500 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 8 treesize of output 7 [2018-11-28 13:35:31,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:31,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:31,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:31,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-11-28 13:35:31,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-28 13:35:31,543 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 11 [2018-11-28 13:35:31,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:31,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:31,565 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-11-28 13:35:31,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-11-28 13:35:31,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-28 13:35:31,627 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:35:31,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:31,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:31,637 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-11-28 13:35:31,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2018-11-28 13:35:37,666 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2018-11-28 13:35:37,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-11-28 13:35:37,701 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 13:35:37,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:35:37,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:35:37,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:35:37,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:44 [2018-11-28 13:35:37,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-28 13:35:37,744 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 14 treesize of output 13 [2018-11-28 13:35:37,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:37,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:37,751 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-11-28 13:35:37,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-11-28 13:35:37,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-28 13:35:37,883 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-11-28 13:35:37,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:37,888 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-11-28 13:35:37,888 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:37,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:37,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:37,895 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2018-11-28 13:35:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:37,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:35:37,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 27 [2018-11-28 13:35:37,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-28 13:35:37,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 13:35:37,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=675, Unknown=2, NotChecked=0, Total=756 [2018-11-28 13:35:37,916 INFO L87 Difference]: Start difference. First operand 232 states and 262 transitions. Second operand 28 states. [2018-11-28 13:35:52,581 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-11-28 13:35:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:59,110 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2018-11-28 13:35:59,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 13:35:59,110 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2018-11-28 13:35:59,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:59,112 INFO L225 Difference]: With dead ends: 279 [2018-11-28 13:35:59,112 INFO L226 Difference]: Without dead ends: 279 [2018-11-28 13:35:59,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=278, Invalid=1691, Unknown=11, NotChecked=0, Total=1980 [2018-11-28 13:35:59,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-28 13:35:59,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 266. [2018-11-28 13:35:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-28 13:35:59,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 307 transitions. [2018-11-28 13:35:59,117 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 307 transitions. Word has length 50 [2018-11-28 13:35:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:59,118 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 307 transitions. [2018-11-28 13:35:59,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-28 13:35:59,118 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 307 transitions. [2018-11-28 13:35:59,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:35:59,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:59,118 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, 1, 1, 1, 1, 1, 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-11-28 13:35:59,119 INFO L423 AbstractCegarLoop]: === Iteration 27 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:35:59,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:59,119 INFO L82 PathProgramCache]: Analyzing trace with hash -869791893, now seen corresponding path program 1 times [2018-11-28 13:35:59,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:59,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:59,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:59,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:59,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:35:59,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:35:59,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:35:59,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:59,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:35:59,621 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-11-28 13:35:59,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:59,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:59,629 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-11-28 13:35:59,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-28 13:35:59,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 13:35:59,653 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 8 treesize of output 7 [2018-11-28 13:35:59,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 13:35:59,664 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-11-28 13:35:59,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,667 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,677 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-28 13:35:59,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-11-28 13:35:59,730 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 11 [2018-11-28 13:35:59,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,748 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-11-28 13:35:59,750 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 11 [2018-11-28 13:35:59,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:35:59,763 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-11-28 13:35:59,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-11-28 13:35:59,824 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:35:59,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,845 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 40 treesize of output 35 [2018-11-28 13:35:59,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:35:59,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:35:59,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:79 [2018-11-28 13:36:05,912 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-11-28 13:36:05,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 96 [2018-11-28 13:36:05,960 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 13:36:05,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:36:05,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:36:06,003 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 82 treesize of output 69 [2018-11-28 13:36:06,012 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 13:36:06,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 13:36:06,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:36:06,025 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 76 treesize of output 63 [2018-11-28 13:36:06,027 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:36:06,028 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-28 13:36:06,028 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:06,034 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:06,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:36:06,054 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:119, output treesize:89 [2018-11-28 13:36:06,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-11-28 13:36:06,131 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 14 treesize of output 13 [2018-11-28 13:36:06,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:06,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:06,148 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 29 treesize of output 30 [2018-11-28 13:36:06,149 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 14 treesize of output 13 [2018-11-28 13:36:06,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:06,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:06,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:06,162 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-11-28 13:36:06,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-11-28 13:36:06,370 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 30 treesize of output 19 [2018-11-28 13:36:06,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:06,378 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-11-28 13:36:06,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:06,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:06,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-28 13:36:06,397 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-11-28 13:36:06,398 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:06,405 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-11-28 13:36:06,406 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:06,409 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:06,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:06,413 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-11-28 13:36:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:36:06,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:36:06,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 36 [2018-11-28 13:36:06,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-28 13:36:06,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 13:36:06,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1191, Unknown=2, NotChecked=0, Total=1332 [2018-11-28 13:36:06,460 INFO L87 Difference]: Start difference. First operand 266 states and 307 transitions. Second operand 37 states. [2018-11-28 13:36:08,960 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2018-11-28 13:36:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:36:09,673 INFO L93 Difference]: Finished difference Result 281 states and 313 transitions. [2018-11-28 13:36:09,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 13:36:09,677 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 50 [2018-11-28 13:36:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:36:09,678 INFO L225 Difference]: With dead ends: 281 [2018-11-28 13:36:09,678 INFO L226 Difference]: Without dead ends: 281 [2018-11-28 13:36:09,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=358, Invalid=2190, Unknown=2, NotChecked=0, Total=2550 [2018-11-28 13:36:09,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-11-28 13:36:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 266. [2018-11-28 13:36:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-28 13:36:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 305 transitions. [2018-11-28 13:36:09,683 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 305 transitions. Word has length 50 [2018-11-28 13:36:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:36:09,684 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 305 transitions. [2018-11-28 13:36:09,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-28 13:36:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 305 transitions. [2018-11-28 13:36:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:36:09,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:36:09,684 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-11-28 13:36:09,685 INFO L423 AbstractCegarLoop]: === Iteration 28 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:36:09,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:09,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1457455045, now seen corresponding path program 1 times [2018-11-28 13:36:09,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:09,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:09,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:09,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:09,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:36:09,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:36:09,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:36:09,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:10,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:36:10,014 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-11-28 13:36:10,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:36:10,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:10,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:10,029 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-11-28 13:36:10,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 13:36:10,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 13:36:10,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-28 13:36:10,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-28 13:36:10,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-11-28 13:36:10,105 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 15 [2018-11-28 13:36:10,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,114 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-11-28 13:36:10,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2018-11-28 13:36:10,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-11-28 13:36:10,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:10,158 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 47 treesize of output 45 [2018-11-28 13:36:10,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,170 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-11-28 13:36:10,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:48 [2018-11-28 13:36:10,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:10,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:10,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:10,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 52 [2018-11-28 13:36:10,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:10,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:67 [2018-11-28 13:36:10,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-11-28 13:36:10,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:10,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-11-28 13:36:10,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:10,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:79 [2018-11-28 13:36:10,311 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 87 treesize of output 86 [2018-11-28 13:36:10,312 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 11 [2018-11-28 13:36:10,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,330 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-11-28 13:36:10,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:90 [2018-11-28 13:36:10,414 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 100 treesize of output 93 [2018-11-28 13:36:10,417 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:36:10,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:10,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:10,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:103 [2018-11-28 13:36:16,508 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-28 13:36:16,575 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 112 treesize of output 105 [2018-11-28 13:36:16,582 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 13:36:16,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:36:16,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:36:16,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 13:36:16,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:123, output treesize:172 [2018-11-28 13:36:16,699 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 89 treesize of output 88 [2018-11-28 13:36:16,701 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 14 treesize of output 13 [2018-11-28 13:36:16,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:16,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:16,720 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-11-28 13:36:16,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:92 [2018-11-28 13:36:16,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:16,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:16,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:16,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:16,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 91 [2018-11-28 13:36:16,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:16,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:16,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:112, output treesize:128 [2018-11-28 13:36:16,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 123 [2018-11-28 13:36:16,972 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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 13:36:16,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:36:16,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:36:17,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-28 13:36:17,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:139, output treesize:331 [2018-11-28 13:36:17,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:17,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 142 [2018-11-28 13:36:17,223 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 11 [2018-11-28 13:36:17,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:17,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:17,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:17,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:142, output treesize:128 [2018-11-28 13:36:17,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 101 [2018-11-28 13:36:17,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:36:17,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:17,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 37 treesize of output 24 [2018-11-28 13:36:17,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:17,356 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-11-28 13:36:17,356 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:17,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2018-11-28 13:36:17,366 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:17,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:17,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:17,390 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:174, output treesize:45 [2018-11-28 13:36:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:36:17,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:36:17,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 40 [2018-11-28 13:36:17,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-28 13:36:17,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-28 13:36:17,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1430, Unknown=2, NotChecked=0, Total=1640 [2018-11-28 13:36:17,455 INFO L87 Difference]: Start difference. First operand 266 states and 305 transitions. Second operand 41 states. [2018-11-28 13:36:32,730 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-11-28 13:36:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:36:39,780 INFO L93 Difference]: Finished difference Result 272 states and 305 transitions. [2018-11-28 13:36:39,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-28 13:36:39,781 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 53 [2018-11-28 13:36:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:36:39,783 INFO L225 Difference]: With dead ends: 272 [2018-11-28 13:36:39,783 INFO L226 Difference]: Without dead ends: 272 [2018-11-28 13:36:39,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=751, Invalid=4790, Unknown=9, NotChecked=0, Total=5550 [2018-11-28 13:36:39,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-28 13:36:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2018-11-28 13:36:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-28 13:36:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 304 transitions. [2018-11-28 13:36:39,790 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 304 transitions. Word has length 53 [2018-11-28 13:36:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:36:39,790 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 304 transitions. [2018-11-28 13:36:39,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-28 13:36:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 304 transitions. [2018-11-28 13:36:39,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:36:39,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:36:39,791 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-11-28 13:36:39,791 INFO L423 AbstractCegarLoop]: === Iteration 29 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:36:39,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:39,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1457455046, now seen corresponding path program 1 times [2018-11-28 13:36:39,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:39,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:39,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:39,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:39,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:36:40,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:36:40,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:36:40,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:40,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:36:40,127 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-11-28 13:36:40,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:36:40,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:40,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:40,134 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-11-28 13:36:40,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 13:36:40,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 13:36:40,170 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-11-28 13:36:40,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-28 13:36:40,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-11-28 13:36:40,201 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 15 [2018-11-28 13:36:40,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,211 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-11-28 13:36:40,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2018-11-28 13:36:40,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-11-28 13:36:40,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:40,241 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 47 treesize of output 45 [2018-11-28 13:36:40,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,251 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-11-28 13:36:40,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:48 [2018-11-28 13:36:40,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:40,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:40,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:40,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 52 [2018-11-28 13:36:40,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:40,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:67 [2018-11-28 13:36:40,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-11-28 13:36:40,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:40,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-11-28 13:36:40,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:40,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:79 [2018-11-28 13:36:40,403 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 87 treesize of output 86 [2018-11-28 13:36:40,405 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 11 [2018-11-28 13:36:40,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,428 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-11-28 13:36:40,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:90 [2018-11-28 13:36:40,512 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 100 treesize of output 93 [2018-11-28 13:36:40,514 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:36:40,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:40,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:40,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:103 [2018-11-28 13:36:46,592 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-28 13:36:46,660 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 112 treesize of output 105 [2018-11-28 13:36:46,669 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 13:36:46,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:36:46,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:36:46,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 13:36:46,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:123, output treesize:172 [2018-11-28 13:36:46,784 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 89 treesize of output 88 [2018-11-28 13:36:46,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 13:36:46,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:46,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:46,803 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-11-28 13:36:46,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:92 [2018-11-28 13:36:46,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:46,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:46,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:46,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:46,939 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 0 case distinctions, treesize of input 31 treesize of output 55 [2018-11-28 13:36:46,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:46,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-11-28 13:36:46,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:46,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:46,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:115, output treesize:106 [2018-11-28 13:36:47,014 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 14 [2018-11-28 13:36:47,017 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 14 treesize of output 13 [2018-11-28 13:36:47,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:47,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:47,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 116 [2018-11-28 13:36:47,052 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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 13:36:47,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 13:36:47,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:36:47,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-28 13:36:47,106 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:125, output treesize:295 [2018-11-28 13:36:47,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 88 [2018-11-28 13:36:47,220 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-11-28 13:36:47,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:47,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:47,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:47,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 166 [2018-11-28 13:36:47,260 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-11-28 13:36:47,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:47,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:47,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:47,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:157, output treesize:147 [2018-11-28 13:36:47,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 132 [2018-11-28 13:36:47,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 54 treesize of output 39 [2018-11-28 13:36:47,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:47,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-11-28 13:36:47,362 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:47,374 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-11-28 13:36:47,374 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:47,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 52 [2018-11-28 13:36:47,387 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:47,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:47,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-28 13:36:47,407 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 18 treesize of output 9 [2018-11-28 13:36:47,407 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:47,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 5 treesize of output 3 [2018-11-28 13:36:47,412 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:47,417 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:47,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:47,425 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:212, output treesize:9 [2018-11-28 13:36:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:36:47,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:36:47,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 39 [2018-11-28 13:36:47,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-28 13:36:47,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-28 13:36:47,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1377, Unknown=2, NotChecked=0, Total=1560 [2018-11-28 13:36:47,453 INFO L87 Difference]: Start difference. First operand 266 states and 304 transitions. Second operand 40 states. [2018-11-28 13:36:50,413 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-11-28 13:36:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:36:51,527 INFO L93 Difference]: Finished difference Result 271 states and 304 transitions. [2018-11-28 13:36:51,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 13:36:51,527 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 53 [2018-11-28 13:36:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:36:51,528 INFO L225 Difference]: With dead ends: 271 [2018-11-28 13:36:51,528 INFO L226 Difference]: Without dead ends: 271 [2018-11-28 13:36:51,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=649, Invalid=4179, Unknown=2, NotChecked=0, Total=4830 [2018-11-28 13:36:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-28 13:36:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 266. [2018-11-28 13:36:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-28 13:36:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 303 transitions. [2018-11-28 13:36:51,532 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 303 transitions. Word has length 53 [2018-11-28 13:36:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:36:51,532 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 303 transitions. [2018-11-28 13:36:51,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-28 13:36:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 303 transitions. [2018-11-28 13:36:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 13:36:51,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:36:51,532 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2018-11-28 13:36:51,532 INFO L423 AbstractCegarLoop]: === Iteration 30 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:36:51,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:51,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1218906967, now seen corresponding path program 1 times [2018-11-28 13:36:51,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:51,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:51,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:51,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:51,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:36:51,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:36:51,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:36:51,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:51,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:36:51,949 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-11-28 13:36:51,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:51,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:51,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 13:36:51,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:51,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:51,975 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-11-28 13:36:51,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:51,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:51,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 13:36:52,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 13:36:52,005 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 10 treesize of output 9 [2018-11-28 13:36:52,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-28 13:36:52,030 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 21 treesize of output 22 [2018-11-28 13:36:52,031 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-11-28 13:36:52,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,038 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-11-28 13:36:52,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-11-28 13:36:52,061 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 36 treesize of output 35 [2018-11-28 13:36:52,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:52,063 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 24 treesize of output 18 [2018-11-28 13:36:52,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,071 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-11-28 13:36:52,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:26 [2018-11-28 13:36:52,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:52,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:52,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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-11-28 13:36:52,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:52,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2018-11-28 13:36:52,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-11-28 13:36:52,118 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 8 treesize of output 11 [2018-11-28 13:36:52,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-28 13:36:52,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:52,135 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 16 treesize of output 27 [2018-11-28 13:36:52,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:52,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:47, output treesize:33 [2018-11-28 13:36:52,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:52,205 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-11-28 13:36:52,207 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 11 [2018-11-28 13:36:52,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:52,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 74 [2018-11-28 13:36:52,240 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 55 [2018-11-28 13:36:52,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 13:36:52,267 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 37 treesize of output 36 [2018-11-28 13:36:52,267 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:36:52,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 13:36:52,292 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:71, output treesize:92 [2018-11-28 13:36:52,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-11-28 13:36:52,395 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:36:52,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 103 [2018-11-28 13:36:52,458 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 93 [2018-11-28 13:36:52,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 106 [2018-11-28 13:36:52,505 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-28 13:36:52,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:36:52,587 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 74 treesize of output 61 [2018-11-28 13:36:52,590 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:36:52,590 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,596 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,638 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 90 treesize of output 73 [2018-11-28 13:36:52,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:52,640 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 16 treesize of output 23 [2018-11-28 13:36:52,640 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,650 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,654 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 75 [2018-11-28 13:36:52,656 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:36:52,657 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,665 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:52,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 13:36:52,695 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:176, output treesize:210 [2018-11-28 13:36:58,775 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2018-11-28 13:36:58,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 127 [2018-11-28 13:36:58,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 121 [2018-11-28 13:36:58,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-11-28 13:36:58,951 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 102 [2018-11-28 13:36:58,952 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:36:59,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-28 13:36:59,133 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 76 [2018-11-28 13:36:59,140 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 13:36:59,140 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 13:36:59,148 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:36:59,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 78 [2018-11-28 13:36:59,158 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:36:59,159 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-28 13:36:59,160 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,171 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,176 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 89 treesize of output 80 [2018-11-28 13:36:59,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:59,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-28 13:36:59,179 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,193 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 80 [2018-11-28 13:36:59,199 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:36:59,200 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-28 13:36:59,200 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,215 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,219 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 80 treesize of output 71 [2018-11-28 13:36:59,220 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:36:59,221 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-28 13:36:59,222 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,229 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2018-11-28 13:36:59,303 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 17 [2018-11-28 13:36:59,303 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-28 13:36:59,311 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:36:59,380 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 71 treesize of output 58 [2018-11-28 13:36:59,389 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 17 [2018-11-28 13:36:59,390 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-28 13:36:59,396 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:36:59,399 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 65 treesize of output 52 [2018-11-28 13:36:59,401 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:36:59,402 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 5 [2018-11-28 13:36:59,402 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,406 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-11-28 13:36:59,457 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 8 variables, input treesize:220, output treesize:245 [2018-11-28 13:36:59,509 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 16 treesize of output 12 [2018-11-28 13:36:59,510 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 12 treesize of output 4 [2018-11-28 13:36:59,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:14 [2018-11-28 13:36:59,536 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 23 treesize of output 24 [2018-11-28 13:36:59,538 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 10 treesize of output 9 [2018-11-28 13:36:59,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:59,544 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-11-28 13:36:59,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-11-28 13:37:03,827 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 6 case distinctions, treesize of input 42 treesize of output 69 [2018-11-28 13:37:03,831 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 13:37:03,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:03,908 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 39 treesize of output 50 [2018-11-28 13:37:03,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:03,938 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 38 treesize of output 44 [2018-11-28 13:37:03,938 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:37:03,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-28 13:37:03,981 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-11-28 13:37:03,983 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 8 treesize of output 7 [2018-11-28 13:37:03,983 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:03,985 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-11-28 13:37:04,006 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:61, output treesize:154 [2018-11-28 13:37:04,109 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 2 case distinctions, treesize of input 76 treesize of output 76 [2018-11-28 13:37:04,111 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2018-11-28 13:37:04,111 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:37:04,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 51 [2018-11-28 13:37:04,161 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:37:04,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-28 13:37:04,216 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-11-28 13:37:04,216 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,222 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 15 treesize of output 3 [2018-11-28 13:37:04,222 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,227 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:37:04,238 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:129, output treesize:45 [2018-11-28 13:37:04,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:04,285 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 44 [2018-11-28 13:37:04,286 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 38 treesize of output 40 [2018-11-28 13:37:04,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,297 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 20 treesize of output 12 [2018-11-28 13:37:04,297 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:37:04,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:37:04,309 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:39 [2018-11-28 13:37:04,388 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 45 treesize of output 42 [2018-11-28 13:37:04,389 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 10 treesize of output 9 [2018-11-28 13:37:04,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:04,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:04,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:04,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-11-28 13:37:04,424 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 73 [2018-11-28 13:37:04,425 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 13:37:04,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 13:37:04,452 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:79 [2018-11-28 13:37:04,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:04,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:04,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-11-28 13:37:04,529 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-11-28 13:37:04,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,533 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-28 13:37:04,534 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-28 13:37:04,549 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 18 treesize of output 9 [2018-11-28 13:37:04,549 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,555 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-11-28 13:37:04,555 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,559 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:04,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:37:04,566 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:74, output treesize:20 [2018-11-28 13:37:04,586 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:37:04,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:37:04,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 47 [2018-11-28 13:37:04,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-28 13:37:04,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-28 13:37:04,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2070, Unknown=3, NotChecked=0, Total=2256 [2018-11-28 13:37:04,602 INFO L87 Difference]: Start difference. First operand 266 states and 303 transitions. Second operand 48 states. [2018-11-28 13:37:05,945 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2018-11-28 13:37:07,743 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 129 DAG size of output: 73 [2018-11-28 13:37:11,113 WARN L180 SmtUtils]: Spent 3.31 s on a formula simplification. DAG size of input: 145 DAG size of output: 75 [2018-11-28 13:37:12,800 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 138 DAG size of output: 76 [2018-11-28 13:37:33,657 WARN L180 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2018-11-28 13:37:35,167 WARN L180 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2018-11-28 13:37:41,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:41,850 INFO L93 Difference]: Finished difference Result 272 states and 305 transitions. [2018-11-28 13:37:41,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-28 13:37:41,850 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 56 [2018-11-28 13:37:41,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:41,851 INFO L225 Difference]: With dead ends: 272 [2018-11-28 13:37:41,851 INFO L226 Difference]: Without dead ends: 272 [2018-11-28 13:37:41,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=914, Invalid=6046, Unknown=12, NotChecked=0, Total=6972 [2018-11-28 13:37:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-28 13:37:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2018-11-28 13:37:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-28 13:37:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 302 transitions. [2018-11-28 13:37:41,857 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 302 transitions. Word has length 56 [2018-11-28 13:37:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:41,857 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 302 transitions. [2018-11-28 13:37:41,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-28 13:37:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 302 transitions. [2018-11-28 13:37:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 13:37:41,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:41,858 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2018-11-28 13:37:41,859 INFO L423 AbstractCegarLoop]: === Iteration 31 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:37:41,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1218906968, now seen corresponding path program 1 times [2018-11-28 13:37:41,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:37:41,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:37:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:37:41,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:37:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:37:42,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:37:42,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:37:42,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:42,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:42,425 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-11-28 13:37:42,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:37:42,429 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:42,430 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 12 treesize of output 21 [2018-11-28 13:37:42,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-11-28 13:37:42,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:42,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:42,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:42,462 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2018-11-28 13:37:42,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-28 13:37:42,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:37:42,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:51 [2018-11-28 13:37:42,552 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 40 treesize of output 37 [2018-11-28 13:37:42,554 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 10 treesize of output 9 [2018-11-28 13:37:42,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2018-11-28 13:37:42,565 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 10 treesize of output 9 [2018-11-28 13:37:42,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:37:42,591 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:83, output treesize:75 [2018-11-28 13:37:42,632 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 54 treesize of output 51 [2018-11-28 13:37:42,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-28 13:37:42,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,677 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 52 treesize of output 53 [2018-11-28 13:37:42,680 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 15 [2018-11-28 13:37:42,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 13:37:42,709 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:107, output treesize:99 [2018-11-28 13:37:42,756 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 67 treesize of output 60 [2018-11-28 13:37:42,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:42,759 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 37 treesize of output 33 [2018-11-28 13:37:42,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,794 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 69 treesize of output 62 [2018-11-28 13:37:42,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:42,797 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 37 treesize of output 33 [2018-11-28 13:37:42,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 13:37:42,825 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:99 [2018-11-28 13:37:42,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:42,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:42,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:42,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:42,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-11-28 13:37:42,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,834 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 13:37:42,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:37:42,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:206, output treesize:63 [2018-11-28 13:37:42,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2018-11-28 13:37:42,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:37:42,913 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 29 treesize of output 38 [2018-11-28 13:37:42,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-11-28 13:37:42,936 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 8 treesize of output 7 [2018-11-28 13:37:42,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:42,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:37:42,952 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:85, output treesize:75 [2018-11-28 13:37:43,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2018-11-28 13:37:43,046 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 11 [2018-11-28 13:37:43,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:43,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:43,073 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 57 [2018-11-28 13:37:43,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 13:37:43,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:43,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:43,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:37:43,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:97 [2018-11-28 13:37:43,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 80 [2018-11-28 13:37:43,212 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:37:43,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:43,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:43,245 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 64 [2018-11-28 13:37:43,249 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-28 13:37:43,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:43,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:43,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:37:43,274 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:139, output treesize:123 [2018-11-28 13:37:49,351 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-11-28 13:37:49,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 104 [2018-11-28 13:37:49,429 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 13:37:49,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:37:49,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:37:49,475 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 98 [2018-11-28 13:37:49,482 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 13:37:49,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 13:37:49,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:37:49,499 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 92 [2018-11-28 13:37:49,501 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:37:49,502 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-28 13:37:49,502 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:49,511 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:49,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 13:37:49,541 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:163, output treesize:177 [2018-11-28 13:37:49,592 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 33 treesize of output 25 [2018-11-28 13:37:49,594 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-28 13:37:49,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:49,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:49,608 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-11-28 13:37:49,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:63 [2018-11-28 13:37:49,661 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-11-28 13:37:49,663 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 10 treesize of output 9 [2018-11-28 13:37:49,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:49,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:49,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:37:49,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:72 [2018-11-28 13:38:05,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:05,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:05,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:05,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:05,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 60 [2018-11-28 13:38:05,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:05,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:38:05,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:05,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 13:38:05,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:127, output treesize:121 [2018-11-28 13:38:05,996 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-11-28 13:38:05,998 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 19 [2018-11-28 13:38:05,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:06,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:38:06,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 106 treesize of output 142 [2018-11-28 13:38:06,062 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:38:06,074 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:38:06,074 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 78 [2018-11-28 13:38:06,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:06,531 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 103 treesize of output 114 [2018-11-28 13:38:06,531 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:06,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:38:06,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 13:38:06,588 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:140, output treesize:169 [2018-11-28 13:38:06,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:06,730 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 103 [2018-11-28 13:38:06,733 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 103 treesize of output 101 [2018-11-28 13:38:06,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:06,763 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:38:06,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:06,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 90 [2018-11-28 13:38:06,765 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:06,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:38:06,830 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:38:06,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 139 treesize of output 154 [2018-11-28 13:38:06,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 144 [2018-11-28 13:38:06,856 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:06,911 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:38:06,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:06,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 175 treesize of output 231 [2018-11-28 13:38:06,959 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:38:06,972 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 212 treesize of output 211 [2018-11-28 13:38:06,972 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:07,292 INFO L267 ElimStorePlain]: Start of recursive call 7: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:38:07,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-11-28 13:38:07,340 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:215, output treesize:356 [2018-11-28 13:38:07,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:07,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:07,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:07,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:07,568 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:38:07,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:07,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 275 [2018-11-28 13:38:07,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:07,571 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 13:38:07,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:07,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:07,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 167 treesize of output 221 [2018-11-28 13:38:07,660 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:38:07,671 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 13:38:07,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:08,001 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 159 [2018-11-28 13:38:08,001 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:08,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:38:08,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:08,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:08,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:08,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 109 [2018-11-28 13:38:08,212 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 78 [2018-11-28 13:38:08,213 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 13:38:08,231 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:38:08,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-28 13:38:08,254 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 14 variables, input treesize:458, output treesize:204 [2018-11-28 13:38:08,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:08,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:08,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 135 [2018-11-28 13:38:08,338 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 66 [2018-11-28 13:38:08,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:38:08,347 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 37 [2018-11-28 13:38:08,347 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:08,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:38:08,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 150 [2018-11-28 13:38:08,394 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:38:08,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:08,434 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:38:08,434 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 118 treesize of output 130 [2018-11-28 13:38:08,435 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:11,624 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2018-11-28 13:38:11,625 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:38:14,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:14,187 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 102 treesize of output 60 [2018-11-28 13:38:14,188 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:16,698 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 50 treesize of output 39 [2018-11-28 13:38:16,698 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:19,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:19,185 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:38:19,186 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 32 [2018-11-28 13:38:19,186 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:21,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:21,206 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 83 treesize of output 51 [2018-11-28 13:38:21,206 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:23,105 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 66 [2018-11-28 13:38:23,106 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:38:24,984 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 41 treesize of output 30 [2018-11-28 13:38:24,985 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:26,847 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 66 treesize of output 53 [2018-11-28 13:38:26,847 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:28,725 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 53 treesize of output 42 [2018-11-28 13:38:28,725 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:30,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:30,593 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 28 [2018-11-28 13:38:30,594 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:32,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:32,439 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:38:32,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 48 [2018-11-28 13:38:32,440 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:34,269 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 19 treesize of output 12 [2018-11-28 13:38:34,270 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:36,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:36,931 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:38:36,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 48 [2018-11-28 13:38:36,932 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:37,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:37,762 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 24 treesize of output 18 [2018-11-28 13:38:37,762 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:40,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:40,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:40,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:40,967 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:38:40,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2018-11-28 13:38:40,968 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:44,860 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 71 treesize of output 52 [2018-11-28 13:38:44,860 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:45,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:38:45,052 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:38:45,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 21 [2018-11-28 13:38:45,053 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 13:38:45,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 139 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:38:45,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:38:45,172 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:261, output treesize:13 [2018-11-28 13:38:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:38:45,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:38:45,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 48 [2018-11-28 13:38:45,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-28 13:38:45,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-28 13:38:45,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2079, Unknown=10, NotChecked=0, Total=2352 [2018-11-28 13:38:45,240 INFO L87 Difference]: Start difference. First operand 266 states and 302 transitions. Second operand 49 states. [2018-11-28 13:38:49,546 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 149 DAG size of output: 102 [2018-11-28 13:39:02,211 WARN L180 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2018-11-28 13:39:02,665 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2018-11-28 13:39:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:39:04,785 INFO L93 Difference]: Finished difference Result 269 states and 302 transitions. [2018-11-28 13:39:04,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-28 13:39:04,785 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 56 [2018-11-28 13:39:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:39:04,786 INFO L225 Difference]: With dead ends: 269 [2018-11-28 13:39:04,786 INFO L226 Difference]: Without dead ends: 269 [2018-11-28 13:39:04,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2159 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=1156, Invalid=7022, Unknown=12, NotChecked=0, Total=8190 [2018-11-28 13:39:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-28 13:39:04,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-11-28 13:39:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-28 13:39:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 301 transitions. [2018-11-28 13:39:04,791 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 301 transitions. Word has length 56 [2018-11-28 13:39:04,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:39:04,792 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 301 transitions. [2018-11-28 13:39:04,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-28 13:39:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 301 transitions. [2018-11-28 13:39:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 13:39:04,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:39:04,793 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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-11-28 13:39:04,793 INFO L423 AbstractCegarLoop]: === Iteration 32 === [create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr7REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr10REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr11REQUIRES_VIOLATION, free_treeErr1REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr17REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr3REQUIRES_VIOLATION]=== [2018-11-28 13:39:04,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:39:04,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1766635303, now seen corresponding path program 1 times [2018-11-28 13:39:04,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:39:04,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:39:04,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:39:04,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:39:04,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:39:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:39:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:39:04,841 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:39:04,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:39:04 BoogieIcfgContainer [2018-11-28 13:39:04,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:39:04,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:39:04,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:39:04,875 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:39:04,876 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:33:57" (3/4) ... [2018-11-28 13:39:04,878 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:39:04,917 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a0214288-65e1-4a7d-b64b-a191bd0a995d/bin-2019/uautomizer/witness.graphml [2018-11-28 13:39:04,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:39:04,918 INFO L168 Benchmark]: Toolchain (without parser) took 308755.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -111.0 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:39:04,918 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:39:04,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:39:04,919 INFO L168 Benchmark]: Boogie Preprocessor took 44.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:39:04,919 INFO L168 Benchmark]: RCFGBuilder took 510.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 63.3 MB). Peak memory consumption was 63.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:39:04,919 INFO L168 Benchmark]: TraceAbstraction took 307815.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.6 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:39:04,919 INFO L168 Benchmark]: Witness Printer took 45.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:39:04,920 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 510.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 63.3 MB). Peak memory consumption was 63.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 307815.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.6 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Witness Printer took 45.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 566]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L619] CALL, EXPR create_tree() [L574] struct node *nodelast = ((void *)0); [L575] struct node *node = ((void *)0); VAL [node={0:0}, nodelast={0:0}] [L576] COND TRUE __VERIFIER_nondet_int() [L577] node = malloc(sizeof *node) VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={0:0}] [L578] COND FALSE !(!node) VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={0:0}] [L580] node->left = ((void *)0) VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={0:0}] [L581] node->right = nodelast VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={0:0}] [L582] COND FALSE !(\read(*nodelast)) VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={0:0}] [L584] int value = __VERIFIER_nondet_int(); [L585] node->value = value VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={0:0}, value=42] [L586] nodelast = node VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={54:0}, value=42] [L576] COND FALSE !(__VERIFIER_nondet_int()) [L588] COND TRUE node != ((void *)0) [L589] node->left = malloc(sizeof *node) VAL [malloc(sizeof *node)={54:0}, malloc(sizeof *node)={55:0}, node={54:0}, nodelast={54:0}, value=42] [L590] COND FALSE !(!node) VAL [malloc(sizeof *node)={54:0}, malloc(sizeof *node)={55:0}, node={54:0}, nodelast={54:0}, value=42] [L592] EXPR node->left VAL [malloc(sizeof *node)={54:0}, malloc(sizeof *node)={55:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L592] node->left->left = ((void *)0) VAL [malloc(sizeof *node)={54:0}, malloc(sizeof *node)={55:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L593] EXPR node->left VAL [malloc(sizeof *node)={54:0}, malloc(sizeof *node)={55:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L593] node->left->right = ((void *)0) VAL [malloc(sizeof *node)={54:0}, malloc(sizeof *node)={55:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L594] EXPR node->left VAL [malloc(sizeof *node)={54:0}, malloc(sizeof *node)={55:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L594] node->left->value = 42 VAL [malloc(sizeof *node)={54:0}, malloc(sizeof *node)={55:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L595] EXPR node->left VAL [malloc(sizeof *node)={54:0}, malloc(sizeof *node)={55:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L595] node->left->parent = node VAL [malloc(sizeof *node)={54:0}, malloc(sizeof *node)={55:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L596] EXPR node->right VAL [malloc(sizeof *node)={54:0}, malloc(sizeof *node)={55:0}, node={54:0}, node->right={0:0}, nodelast={54:0}, value=42] [L596] node = node->right [L588] COND FALSE !(node != ((void *)0)) VAL [malloc(sizeof *node)={54:0}, malloc(sizeof *node)={55:0}, node={0:0}, nodelast={54:0}, value=42] [L598] return nodelast; VAL [\result={54:0}, malloc(sizeof *node)={54:0}, malloc(sizeof *node)={55:0}, node={0:0}, nodelast={54:0}, value=42] [L619] RET, EXPR create_tree() VAL [create_tree()={54:0}] [L619] struct node *data = create_tree(); [L620] COND FALSE !(!data) VAL [data={54:0}] [L622] CALL inspect(data) VAL [node={54:0}] [L564] COND FALSE !(!(node)) VAL [node={54:0}, node={54:0}] [L565] COND TRUE node != ((void *)0) VAL [node={54:0}, node={54:0}] [L566] node->left VAL [node={54:0}, node={54:0}, node->left={55:0}] [L566] COND TRUE node->left [L567] EXPR node->left VAL [node={54:0}, node={54:0}, node->left={55:0}] [L567] EXPR node->left->value VAL [node={54:0}, node={54:0}, node->left={55:0}, node->left->value=42] [L567] COND FALSE !(!(node->left->value == 42)) [L568] EXPR node->value VAL [node={54:0}, node={54:0}, node->value=42] [L568] COND FALSE !(!(node->value)) [L569] EXPR node->parent VAL [node={54:0}, node={54:0}, node->parent={52:53}] [L569] node = node->parent [L565] COND TRUE node != ((void *)0) VAL [node={52:53}, node={54:0}] [L566] node->left - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 158 locations, 59 error locations. UNSAFE Result, 307.7s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 175.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3547 SDtfs, 3941 SDslu, 17338 SDs, 0 SdLazy, 18086 SolverSat, 851 SolverUnsat, 41 SolverUnknown, 0 SolverNotchecked, 48.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1331 GetRequests, 510 SyntacticMatches, 76 SemanticMatches, 745 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10214 ImplicationChecksByTransitivity, 210.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 310 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 131.0s InterpolantComputationTime, 1716 NumberOfCodeBlocks, 1716 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1612 ConstructedInterpolants, 243 QuantifiedInterpolants, 1521584 SizeOfPredicates, 244 NumberOfNonLiveVariables, 3327 ConjunctsInSsa, 597 ConjunctsInUnsatCore, 45 InterpolantComputations, 17 PerfectInterpolantSequences, 147/323 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...