./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/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 04d17eda3d030bee53a60ea5a86a683be82674c1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:33:24,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:33:24,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:33:24,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:33:24,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:33:24,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:33:24,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:33:24,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:33:24,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:33:24,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:33:24,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:33:24,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:33:24,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:33:24,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:33:24,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:33:24,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:33:24,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:33:24,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:33:24,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:33:24,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:33:24,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:33:24,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:33:24,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:33:24,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:33:24,950 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:33:24,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:33:24,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:33:24,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:33:24,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:33:24,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:33:24,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:33:24,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:33:24,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:33:24,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:33:24,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:33:24,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:33:24,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:33:24,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:33:24,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:33:24,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:33:24,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:33:24,956 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 10:33:24,965 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:33:24,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:33:24,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:33:24,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:33:24,966 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:33:24,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:33:24,966 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:33:24,966 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:33:24,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:33:24,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:33:24,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:33:24,967 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 10:33:24,967 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 10:33:24,967 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 10:33:24,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:33:24,967 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:33:24,967 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:33:24,967 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:33:24,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:33:24,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:33:24,968 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:33:24,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:33:24,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:33:24,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:33:24,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:33:24,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:33:24,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:33:24,969 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:33:24,969 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(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 -> 04d17eda3d030bee53a60ea5a86a683be82674c1 [2019-12-07 10:33:25,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:33:25,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:33:25,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:33:25,081 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:33:25,081 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:33:25,082 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2019-12-07 10:33:25,119 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/data/ce76fbf59/1a3fa9035d0040629012b55317a2a054/FLAGb56ab8e61 [2019-12-07 10:33:25,618 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:33:25,618 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2019-12-07 10:33:25,627 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/data/ce76fbf59/1a3fa9035d0040629012b55317a2a054/FLAGb56ab8e61 [2019-12-07 10:33:26,104 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/data/ce76fbf59/1a3fa9035d0040629012b55317a2a054 [2019-12-07 10:33:26,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:33:26,107 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 10:33:26,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:33:26,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:33:26,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:33:26,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:33:26" (1/1) ... [2019-12-07 10:33:26,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d23583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:33:26, skipping insertion in model container [2019-12-07 10:33:26,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:33:26" (1/1) ... [2019-12-07 10:33:26,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:33:26,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:33:26,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:33:26,371 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:33:26,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:33:26,443 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:33:26,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:33:26 WrapperNode [2019-12-07 10:33:26,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:33:26,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:33:26,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:33:26,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:33:26,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:33:26" (1/1) ... [2019-12-07 10:33:26,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:33:26" (1/1) ... [2019-12-07 10:33:26,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:33:26" (1/1) ... [2019-12-07 10:33:26,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:33:26" (1/1) ... [2019-12-07 10:33:26,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:33:26" (1/1) ... [2019-12-07 10:33:26,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:33:26" (1/1) ... [2019-12-07 10:33:26,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:33:26" (1/1) ... [2019-12-07 10:33:26,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:33:26,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:33:26,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:33:26,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:33:26,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:33:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/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 [2019-12-07 10:33:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 10:33:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:33:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 10:33:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 10:33:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-12-07 10:33:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-12-07 10:33:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-12-07 10:33:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_last [2019-12-07 10:33:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 10:33:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 10:33:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 10:33:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 10:33:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 10:33:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 10:33:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 10:33:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 10:33:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 10:33:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 10:33:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 10:33:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 10:33:26,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 10:33:26,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 10:33:26,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 10:33:26,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 10:33:26,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 10:33:26,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 10:33:26,538 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 10:33:26,538 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 10:33:26,538 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 10:33:26,538 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 10:33:26,538 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 10:33:26,538 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 10:33:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 10:33:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 10:33:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 10:33:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 10:33:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-12-07 10:33:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:33:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:33:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:33:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-12-07 10:33:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_last [2019-12-07 10:33:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:33:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:33:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 10:33:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:33:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 10:33:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 10:33:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:33:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:33:26,703 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-12-07 10:33:26,854 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:33:26,854 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-12-07 10:33:26,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:33:26 BoogieIcfgContainer [2019-12-07 10:33:26,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:33:26,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:33:26,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:33:26,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:33:26,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:33:26" (1/3) ... [2019-12-07 10:33:26,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d04cf75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:33:26, skipping insertion in model container [2019-12-07 10:33:26,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:33:26" (2/3) ... [2019-12-07 10:33:26,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d04cf75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:33:26, skipping insertion in model container [2019-12-07 10:33:26,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:33:26" (3/3) ... [2019-12-07 10:33:26,860 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.i [2019-12-07 10:33:26,866 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:33:26,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 40 error locations. [2019-12-07 10:33:26,879 INFO L249 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2019-12-07 10:33:26,891 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:33:26,891 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 10:33:26,891 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:33:26,892 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:33:26,892 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:33:26,892 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:33:26,892 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:33:26,892 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:33:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-12-07 10:33:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:33:26,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:33:26,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:33:26,911 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:33:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:33:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1564486077, now seen corresponding path program 1 times [2019-12-07 10:33:26,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:33:26,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791903814] [2019-12-07 10:33:26,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:33:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:27,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791903814] [2019-12-07 10:33:27,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:33:27,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:33:27,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509460585] [2019-12-07 10:33:27,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:33:27,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:33:27,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:33:27,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:33:27,068 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2019-12-07 10:33:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:33:27,222 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-12-07 10:33:27,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:33:27,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:33:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:33:27,230 INFO L225 Difference]: With dead ends: 89 [2019-12-07 10:33:27,231 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 10:33:27,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:33:27,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 10:33:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-12-07 10:33:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 10:33:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-12-07 10:33:27,258 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 11 [2019-12-07 10:33:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:33:27,259 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-12-07 10:33:27,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:33:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-12-07 10:33:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:33:27,259 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:33:27,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:33:27,260 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:33:27,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:33:27,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1564486076, now seen corresponding path program 1 times [2019-12-07 10:33:27,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:33:27,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613166491] [2019-12-07 10:33:27,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:33:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:27,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613166491] [2019-12-07 10:33:27,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:33:27,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:33:27,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464357654] [2019-12-07 10:33:27,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:33:27,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:33:27,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:33:27,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:33:27,318 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 4 states. [2019-12-07 10:33:27,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:33:27,438 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2019-12-07 10:33:27,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:33:27,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:33:27,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:33:27,439 INFO L225 Difference]: With dead ends: 80 [2019-12-07 10:33:27,440 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 10:33:27,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:33:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 10:33:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2019-12-07 10:33:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 10:33:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-12-07 10:33:27,446 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 11 [2019-12-07 10:33:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:33:27,447 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2019-12-07 10:33:27,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:33:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2019-12-07 10:33:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:33:27,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:33:27,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:33:27,448 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:33:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:33:27,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1220625091, now seen corresponding path program 1 times [2019-12-07 10:33:27,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:33:27,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000470299] [2019-12-07 10:33:27,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:33:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:27,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000470299] [2019-12-07 10:33:27,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:33:27,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:33:27,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070117499] [2019-12-07 10:33:27,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:33:27,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:33:27,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:33:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:33:27,506 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 6 states. [2019-12-07 10:33:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:33:27,678 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2019-12-07 10:33:27,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:33:27,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 10:33:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:33:27,680 INFO L225 Difference]: With dead ends: 83 [2019-12-07 10:33:27,680 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 10:33:27,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:33:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 10:33:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2019-12-07 10:33:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 10:33:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-12-07 10:33:27,688 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 15 [2019-12-07 10:33:27,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:33:27,689 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-12-07 10:33:27,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:33:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-12-07 10:33:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:33:27,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:33:27,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:33:27,690 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:33:27,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:33:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash -154711097, now seen corresponding path program 1 times [2019-12-07 10:33:27,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:33:27,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889198808] [2019-12-07 10:33:27,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:33:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:27,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889198808] [2019-12-07 10:33:27,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:33:27,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:33:27,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377295683] [2019-12-07 10:33:27,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:33:27,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:33:27,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:33:27,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:33:27,739 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 4 states. [2019-12-07 10:33:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:33:27,834 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-12-07 10:33:27,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:33:27,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 10:33:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:33:27,835 INFO L225 Difference]: With dead ends: 87 [2019-12-07 10:33:27,835 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 10:33:27,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:33:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 10:33:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-12-07 10:33:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 10:33:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-12-07 10:33:27,843 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 15 [2019-12-07 10:33:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:33:27,843 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-12-07 10:33:27,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:33:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-12-07 10:33:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:33:27,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:33:27,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:33:27,845 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:33:27,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:33:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash -494521606, now seen corresponding path program 1 times [2019-12-07 10:33:27,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:33:27,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641549904] [2019-12-07 10:33:27,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:33:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:27,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641549904] [2019-12-07 10:33:27,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:33:27,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:33:27,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848680288] [2019-12-07 10:33:27,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:33:27,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:33:27,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:33:27,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:33:27,916 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 8 states. [2019-12-07 10:33:28,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:33:28,195 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2019-12-07 10:33:28,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:33:28,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-07 10:33:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:33:28,197 INFO L225 Difference]: With dead ends: 124 [2019-12-07 10:33:28,197 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 10:33:28,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:33:28,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 10:33:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2019-12-07 10:33:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 10:33:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2019-12-07 10:33:28,206 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 17 [2019-12-07 10:33:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:33:28,207 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2019-12-07 10:33:28,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:33:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2019-12-07 10:33:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:33:28,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:33:28,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:33:28,208 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:33:28,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:33:28,208 INFO L82 PathProgramCache]: Analyzing trace with hash -494521605, now seen corresponding path program 1 times [2019-12-07 10:33:28,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:33:28,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931267738] [2019-12-07 10:33:28,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:33:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:28,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931267738] [2019-12-07 10:33:28,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:33:28,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:33:28,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559867608] [2019-12-07 10:33:28,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:33:28,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:33:28,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:33:28,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:33:28,260 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 7 states. [2019-12-07 10:33:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:33:28,418 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-12-07 10:33:28,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:33:28,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 10:33:28,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:33:28,419 INFO L225 Difference]: With dead ends: 85 [2019-12-07 10:33:28,419 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 10:33:28,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:33:28,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 10:33:28,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-12-07 10:33:28,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 10:33:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-12-07 10:33:28,423 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 17 [2019-12-07 10:33:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:33:28,423 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-12-07 10:33:28,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:33:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-12-07 10:33:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:33:28,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:33:28,424 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:33:28,424 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:33:28,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:33:28,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1032465986, now seen corresponding path program 1 times [2019-12-07 10:33:28,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:33:28,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373541979] [2019-12-07 10:33:28,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:33:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:28,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373541979] [2019-12-07 10:33:28,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685714198] [2019-12-07 10:33:28,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:33:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:28,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:33:28,556 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:33:28,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:33:28,603 INFO L377 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-07 10:33:28,604 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:33:28,613 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 10:33:28,613 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:33:28,613 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 10:33:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:28,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:33:28,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-12-07 10:33:28,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425583621] [2019-12-07 10:33:28,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:33:28,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:33:28,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:33:28,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:33:28,629 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 7 states. [2019-12-07 10:33:28,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:33:28,768 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-12-07 10:33:28,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:33:28,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-07 10:33:28,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:33:28,768 INFO L225 Difference]: With dead ends: 81 [2019-12-07 10:33:28,768 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 10:33:28,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:33:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 10:33:28,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-12-07 10:33:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 10:33:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-12-07 10:33:28,773 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 22 [2019-12-07 10:33:28,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:33:28,773 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-12-07 10:33:28,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:33:28,773 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-12-07 10:33:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:33:28,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:33:28,774 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:33:28,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:33:28,975 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:33:28,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:33:28,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1032465985, now seen corresponding path program 1 times [2019-12-07 10:33:28,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:33:28,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364007066] [2019-12-07 10:33:28,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:33:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:29,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364007066] [2019-12-07 10:33:29,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012486134] [2019-12-07 10:33:29,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:33:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:29,169 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 10:33:29,170 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:33:29,176 INFO L377 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 [2019-12-07 10:33:29,177 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:33:29,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:33:29,180 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:33:29,180 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:33:29,202 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:33:29,202 INFO L377 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-07 10:33:29,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:33:29,213 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 10:33:29,214 INFO L534 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. [2019-12-07 10:33:29,214 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-12-07 10:33:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:29,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:33:29,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-12-07 10:33:29,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834391439] [2019-12-07 10:33:29,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:33:29,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:33:29,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:33:29,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:33:29,221 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 8 states. [2019-12-07 10:33:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:33:29,393 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2019-12-07 10:33:29,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:33:29,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-07 10:33:29,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:33:29,395 INFO L225 Difference]: With dead ends: 80 [2019-12-07 10:33:29,395 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 10:33:29,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:33:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 10:33:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-12-07 10:33:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 10:33:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-12-07 10:33:29,400 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 22 [2019-12-07 10:33:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:33:29,400 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-12-07 10:33:29,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:33:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-12-07 10:33:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:33:29,401 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:33:29,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:33:29,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:33:29,602 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:33:29,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:33:29,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2091587377, now seen corresponding path program 1 times [2019-12-07 10:33:29,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:33:29,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137114447] [2019-12-07 10:33:29,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:33:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:29,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137114447] [2019-12-07 10:33:29,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576860804] [2019-12-07 10:33:29,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:33:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:29,839 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:33:29,840 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:33:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:29,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:33:29,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-12-07 10:33:29,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473316559] [2019-12-07 10:33:29,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:33:29,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:33:29,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:33:29,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:33:29,855 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 9 states. [2019-12-07 10:33:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:33:30,048 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-12-07 10:33:30,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:33:30,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-07 10:33:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:33:30,049 INFO L225 Difference]: With dead ends: 91 [2019-12-07 10:33:30,049 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 10:33:30,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:33:30,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 10:33:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2019-12-07 10:33:30,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 10:33:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-12-07 10:33:30,052 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 24 [2019-12-07 10:33:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:33:30,052 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-12-07 10:33:30,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:33:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-12-07 10:33:30,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:33:30,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:33:30,053 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:33:30,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:33:30,255 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:33:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:33:30,255 INFO L82 PathProgramCache]: Analyzing trace with hash -815900902, now seen corresponding path program 2 times [2019-12-07 10:33:30,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:33:30,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112394912] [2019-12-07 10:33:30,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:33:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:30,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112394912] [2019-12-07 10:33:30,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208989981] [2019-12-07 10:33:30,440 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:33:30,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:33:30,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:33:30,544 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 10:33:30,545 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:33:30,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:33:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:30,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:33:30,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-12-07 10:33:30,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068443942] [2019-12-07 10:33:30,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:33:30,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:33:30,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:33:30,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:33:30,568 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 8 states. [2019-12-07 10:33:30,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:33:30,766 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2019-12-07 10:33:30,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:33:30,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-12-07 10:33:30,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:33:30,766 INFO L225 Difference]: With dead ends: 81 [2019-12-07 10:33:30,767 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 10:33:30,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:33:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 10:33:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-12-07 10:33:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 10:33:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2019-12-07 10:33:30,770 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 31 [2019-12-07 10:33:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:33:30,770 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2019-12-07 10:33:30,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:33:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2019-12-07 10:33:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 10:33:30,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:33:30,771 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 10:33:30,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:33:30,972 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:33:30,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:33:30,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1325929373, now seen corresponding path program 1 times [2019-12-07 10:33:30,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:33:30,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583108239] [2019-12-07 10:33:30,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:33:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:31,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583108239] [2019-12-07 10:33:31,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263383414] [2019-12-07 10:33:31,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:33:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:33:31,380 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 10:33:31,382 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:33:31,386 INFO L377 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 [2019-12-07 10:33:31,387 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:33:31,390 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:33:31,390 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:33:31,390 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:33:31,406 INFO L377 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 5 treesize of output 3 [2019-12-07 10:33:31,406 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:33:31,409 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:33:31,410 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:33:31,410 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-12-07 10:33:31,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:33:31,500 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:33:31,526 INFO L343 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2019-12-07 10:33:31,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 28 [2019-12-07 10:33:31,526 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:33:31,539 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 10:33:31,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:33:31,539 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:21 [2019-12-07 10:33:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:33:31,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:33:31,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-12-07 10:33:31,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654520108] [2019-12-07 10:33:31,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 10:33:31,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:33:31,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 10:33:31,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:33:31,614 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 20 states. [2019-12-07 10:35:06,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:06,768 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-12-07 10:35:06,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:35:06,769 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2019-12-07 10:35:06,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:06,770 INFO L225 Difference]: With dead ends: 132 [2019-12-07 10:35:06,770 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 10:35:06,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=173, Invalid=694, Unknown=3, NotChecked=0, Total=870 [2019-12-07 10:35:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 10:35:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 97. [2019-12-07 10:35:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 10:35:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-12-07 10:35:06,774 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 32 [2019-12-07 10:35:06,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:06,774 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-12-07 10:35:06,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 10:35:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-12-07 10:35:06,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 10:35:06,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:06,775 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 10:35:06,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:06,977 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:06,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:06,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1325929374, now seen corresponding path program 1 times [2019-12-07 10:35:06,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:06,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709726024] [2019-12-07 10:35:06,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:07,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709726024] [2019-12-07 10:35:07,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072654110] [2019-12-07 10:35:07,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:07,222 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 10:35:07,224 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:07,227 INFO L377 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 [2019-12-07 10:35:07,227 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:07,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:07,231 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:07,231 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 10:35:07,246 INFO L377 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 5 treesize of output 3 [2019-12-07 10:35:07,247 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:07,249 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:07,250 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:07,250 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-12-07 10:35:07,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:07,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:07,304 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 10:35:07,305 INFO L377 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 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 10:35:07,305 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:07,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:07,314 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:35:07,314 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-12-07 10:35:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:07,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:07,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-12-07 10:35:07,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880634554] [2019-12-07 10:35:07,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 10:35:07,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:07,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 10:35:07,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:35:07,379 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 17 states. [2019-12-07 10:35:08,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:08,015 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2019-12-07 10:35:08,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:35:08,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-12-07 10:35:08,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:08,016 INFO L225 Difference]: With dead ends: 142 [2019-12-07 10:35:08,016 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 10:35:08,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2019-12-07 10:35:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 10:35:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2019-12-07 10:35:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 10:35:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2019-12-07 10:35:08,020 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 32 [2019-12-07 10:35:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:08,021 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2019-12-07 10:35:08,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 10:35:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2019-12-07 10:35:08,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:35:08,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:08,022 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 10:35:08,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:08,223 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:08,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1845862396, now seen corresponding path program 1 times [2019-12-07 10:35:08,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:08,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823027848] [2019-12-07 10:35:08,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:35:08,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823027848] [2019-12-07 10:35:08,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:08,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 10:35:08,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818472180] [2019-12-07 10:35:08,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:35:08,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:08,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:35:08,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:35:08,360 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand 12 states. [2019-12-07 10:35:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:08,860 INFO L93 Difference]: Finished difference Result 169 states and 210 transitions. [2019-12-07 10:35:08,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:35:08,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-12-07 10:35:08,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:08,861 INFO L225 Difference]: With dead ends: 169 [2019-12-07 10:35:08,861 INFO L226 Difference]: Without dead ends: 169 [2019-12-07 10:35:08,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:35:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-12-07 10:35:08,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 127. [2019-12-07 10:35:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 10:35:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2019-12-07 10:35:08,865 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 33 [2019-12-07 10:35:08,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:08,865 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2019-12-07 10:35:08,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:35:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2019-12-07 10:35:08,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:35:08,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:08,866 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 10:35:08,866 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:08,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:08,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1845862397, now seen corresponding path program 1 times [2019-12-07 10:35:08,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:08,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503061763] [2019-12-07 10:35:08,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:35:08,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503061763] [2019-12-07 10:35:08,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:08,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 10:35:08,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224382227] [2019-12-07 10:35:08,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:35:08,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:08,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:35:08,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:35:08,956 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand 12 states. [2019-12-07 10:35:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:09,403 INFO L93 Difference]: Finished difference Result 164 states and 203 transitions. [2019-12-07 10:35:09,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:35:09,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-12-07 10:35:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:09,404 INFO L225 Difference]: With dead ends: 164 [2019-12-07 10:35:09,404 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 10:35:09,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:35:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 10:35:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 127. [2019-12-07 10:35:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 10:35:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-12-07 10:35:09,408 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 33 [2019-12-07 10:35:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:09,408 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-12-07 10:35:09,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:35:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-12-07 10:35:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 10:35:09,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:09,409 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 10:35:09,409 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:09,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1620373340, now seen corresponding path program 1 times [2019-12-07 10:35:09,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:09,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282914436] [2019-12-07 10:35:09,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:35:09,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282914436] [2019-12-07 10:35:09,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:09,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 10:35:09,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925665178] [2019-12-07 10:35:09,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:35:09,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:09,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:35:09,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:35:09,512 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 12 states. [2019-12-07 10:35:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:09,866 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2019-12-07 10:35:09,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:35:09,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-12-07 10:35:09,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:09,867 INFO L225 Difference]: With dead ends: 126 [2019-12-07 10:35:09,867 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 10:35:09,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-07 10:35:09,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 10:35:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-12-07 10:35:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 10:35:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 153 transitions. [2019-12-07 10:35:09,871 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 153 transitions. Word has length 36 [2019-12-07 10:35:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:09,871 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 153 transitions. [2019-12-07 10:35:09,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:35:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 153 transitions. [2019-12-07 10:35:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 10:35:09,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:09,871 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 10:35:09,872 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:09,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:09,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1308465033, now seen corresponding path program 1 times [2019-12-07 10:35:09,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:09,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128346199] [2019-12-07 10:35:09,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:35:09,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128346199] [2019-12-07 10:35:09,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:09,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:35:09,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745460294] [2019-12-07 10:35:09,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:35:09,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:09,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:35:09,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:35:09,924 INFO L87 Difference]: Start difference. First operand 126 states and 153 transitions. Second operand 8 states. [2019-12-07 10:35:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:10,145 INFO L93 Difference]: Finished difference Result 127 states and 153 transitions. [2019-12-07 10:35:10,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:35:10,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 10:35:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:10,146 INFO L225 Difference]: With dead ends: 127 [2019-12-07 10:35:10,146 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 10:35:10,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:35:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 10:35:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-12-07 10:35:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 10:35:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 153 transitions. [2019-12-07 10:35:10,150 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 153 transitions. Word has length 37 [2019-12-07 10:35:10,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:10,150 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 153 transitions. [2019-12-07 10:35:10,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:35:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 153 transitions. [2019-12-07 10:35:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 10:35:10,151 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:10,151 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 10:35:10,151 INFO L410 AbstractCegarLoop]: === Iteration 17 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:10,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:10,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1308465034, now seen corresponding path program 1 times [2019-12-07 10:35:10,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:10,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920460449] [2019-12-07 10:35:10,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:35:10,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920460449] [2019-12-07 10:35:10,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:10,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 10:35:10,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323024066] [2019-12-07 10:35:10,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:35:10,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:10,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:35:10,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:35:10,319 INFO L87 Difference]: Start difference. First operand 126 states and 153 transitions. Second operand 14 states. [2019-12-07 10:35:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:10,923 INFO L93 Difference]: Finished difference Result 188 states and 230 transitions. [2019-12-07 10:35:10,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:35:10,923 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-12-07 10:35:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:10,925 INFO L225 Difference]: With dead ends: 188 [2019-12-07 10:35:10,925 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 10:35:10,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:35:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 10:35:10,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 150. [2019-12-07 10:35:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-12-07 10:35:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 188 transitions. [2019-12-07 10:35:10,930 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 188 transitions. Word has length 37 [2019-12-07 10:35:10,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:10,930 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 188 transitions. [2019-12-07 10:35:10,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:35:10,931 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 188 transitions. [2019-12-07 10:35:10,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 10:35:10,931 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:10,931 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 10:35:10,931 INFO L410 AbstractCegarLoop]: === Iteration 18 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:10,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:10,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1308034084, now seen corresponding path program 1 times [2019-12-07 10:35:10,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:10,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976452638] [2019-12-07 10:35:10,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:35:11,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976452638] [2019-12-07 10:35:11,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:11,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 10:35:11,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119222540] [2019-12-07 10:35:11,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:35:11,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:11,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:35:11,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:35:11,033 INFO L87 Difference]: Start difference. First operand 150 states and 188 transitions. Second operand 12 states. [2019-12-07 10:35:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:11,463 INFO L93 Difference]: Finished difference Result 182 states and 226 transitions. [2019-12-07 10:35:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:35:11,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-12-07 10:35:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:11,464 INFO L225 Difference]: With dead ends: 182 [2019-12-07 10:35:11,464 INFO L226 Difference]: Without dead ends: 182 [2019-12-07 10:35:11,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:35:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-07 10:35:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 156. [2019-12-07 10:35:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-07 10:35:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 195 transitions. [2019-12-07 10:35:11,468 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 195 transitions. Word has length 37 [2019-12-07 10:35:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:11,468 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 195 transitions. [2019-12-07 10:35:11,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:35:11,469 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 195 transitions. [2019-12-07 10:35:11,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 10:35:11,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:11,469 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 10:35:11,469 INFO L410 AbstractCegarLoop]: === Iteration 19 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:11,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:11,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1894351014, now seen corresponding path program 1 times [2019-12-07 10:35:11,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:11,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611909050] [2019-12-07 10:35:11,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:35:11,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611909050] [2019-12-07 10:35:11,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:11,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:35:11,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131118136] [2019-12-07 10:35:11,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:35:11,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:11,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:35:11,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:35:11,522 INFO L87 Difference]: Start difference. First operand 156 states and 195 transitions. Second operand 7 states. [2019-12-07 10:35:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:11,698 INFO L93 Difference]: Finished difference Result 155 states and 193 transitions. [2019-12-07 10:35:11,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:35:11,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-07 10:35:11,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:11,699 INFO L225 Difference]: With dead ends: 155 [2019-12-07 10:35:11,699 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 10:35:11,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:35:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 10:35:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-12-07 10:35:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 10:35:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 193 transitions. [2019-12-07 10:35:11,703 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 193 transitions. Word has length 38 [2019-12-07 10:35:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:11,703 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 193 transitions. [2019-12-07 10:35:11,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:35:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 193 transitions. [2019-12-07 10:35:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 10:35:11,704 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:11,704 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 10:35:11,704 INFO L410 AbstractCegarLoop]: === Iteration 20 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:11,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:11,704 INFO L82 PathProgramCache]: Analyzing trace with hash -990519949, now seen corresponding path program 1 times [2019-12-07 10:35:11,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:11,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027935386] [2019-12-07 10:35:11,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:35:11,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027935386] [2019-12-07 10:35:11,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:11,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 10:35:11,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355555578] [2019-12-07 10:35:11,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 10:35:11,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:11,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 10:35:11,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:35:11,908 INFO L87 Difference]: Start difference. First operand 155 states and 193 transitions. Second operand 17 states. [2019-12-07 10:35:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:12,650 INFO L93 Difference]: Finished difference Result 151 states and 181 transitions. [2019-12-07 10:35:12,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 10:35:12,650 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-12-07 10:35:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:12,651 INFO L225 Difference]: With dead ends: 151 [2019-12-07 10:35:12,651 INFO L226 Difference]: Without dead ends: 151 [2019-12-07 10:35:12,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2019-12-07 10:35:12,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-12-07 10:35:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2019-12-07 10:35:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 10:35:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 175 transitions. [2019-12-07 10:35:12,655 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 175 transitions. Word has length 39 [2019-12-07 10:35:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:12,655 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 175 transitions. [2019-12-07 10:35:12,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 10:35:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 175 transitions. [2019-12-07 10:35:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 10:35:12,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:12,655 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 10:35:12,655 INFO L410 AbstractCegarLoop]: === Iteration 21 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:12,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:12,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1404660633, now seen corresponding path program 1 times [2019-12-07 10:35:12,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:12,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255461160] [2019-12-07 10:35:12,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:35:12,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255461160] [2019-12-07 10:35:12,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:12,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:35:12,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047514999] [2019-12-07 10:35:12,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:35:12,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:12,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:35:12,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:35:12,780 INFO L87 Difference]: Start difference. First operand 145 states and 175 transitions. Second operand 15 states. [2019-12-07 10:35:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:13,295 INFO L93 Difference]: Finished difference Result 173 states and 208 transitions. [2019-12-07 10:35:13,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:35:13,295 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-12-07 10:35:13,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:13,296 INFO L225 Difference]: With dead ends: 173 [2019-12-07 10:35:13,296 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 10:35:13,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2019-12-07 10:35:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 10:35:13,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 149. [2019-12-07 10:35:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 10:35:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 180 transitions. [2019-12-07 10:35:13,300 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 180 transitions. Word has length 39 [2019-12-07 10:35:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:13,300 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 180 transitions. [2019-12-07 10:35:13,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:35:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 180 transitions. [2019-12-07 10:35:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:35:13,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:13,301 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:13,301 INFO L410 AbstractCegarLoop]: === Iteration 22 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:13,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:13,301 INFO L82 PathProgramCache]: Analyzing trace with hash -276306935, now seen corresponding path program 2 times [2019-12-07 10:35:13,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:13,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391549996] [2019-12-07 10:35:13,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:13,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391549996] [2019-12-07 10:35:13,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252341004] [2019-12-07 10:35:13,367 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:13,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:35:13,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:35:13,435 INFO L264 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:35:13,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:13,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:13,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-12-07 10:35:13,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446631204] [2019-12-07 10:35:13,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:35:13,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:13,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:35:13,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:35:13,452 INFO L87 Difference]: Start difference. First operand 149 states and 180 transitions. Second operand 10 states. [2019-12-07 10:35:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:13,636 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2019-12-07 10:35:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:35:13,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-07 10:35:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:13,637 INFO L225 Difference]: With dead ends: 100 [2019-12-07 10:35:13,637 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 10:35:13,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:35:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 10:35:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-12-07 10:35:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 10:35:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2019-12-07 10:35:13,639 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 40 [2019-12-07 10:35:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:13,639 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2019-12-07 10:35:13,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:35:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2019-12-07 10:35:13,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 10:35:13,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:13,640 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-12-07 10:35:13,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:13,841 INFO L410 AbstractCegarLoop]: === Iteration 23 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:13,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1593122815, now seen corresponding path program 1 times [2019-12-07 10:35:13,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:13,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570890018] [2019-12-07 10:35:13,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:14,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570890018] [2019-12-07 10:35:14,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70043326] [2019-12-07 10:35:14,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:14,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 65 conjunts are in the unsatisfiable core [2019-12-07 10:35:14,213 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:14,235 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:14,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:35:14,236 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:14,238 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:14,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:14,238 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 10:35:14,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:35:14,270 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:14,274 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:14,274 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:14,274 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 10:35:14,292 INFO L377 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 28 treesize of output 23 [2019-12-07 10:35:14,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:14,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:14,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:14,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2019-12-07 10:35:14,298 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:14,308 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:14,308 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:14,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:14,313 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:14,313 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:26 [2019-12-07 10:35:14,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:14,365 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:14,365 INFO L377 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 56 treesize of output 111 [2019-12-07 10:35:14,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:14,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:14,366 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:14,381 INFO L614 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-12-07 10:35:14,381 INFO L534 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. [2019-12-07 10:35:14,382 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2019-12-07 10:35:14,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 10:35:14,683 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:14,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:14,692 INFO L534 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. [2019-12-07 10:35:14,692 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:72 [2019-12-07 10:35:14,806 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:14,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 67 [2019-12-07 10:35:14,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:14,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:14,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:14,809 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:14,809 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:5 [2019-12-07 10:35:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:14,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:14,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 31 [2019-12-07 10:35:14,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565419889] [2019-12-07 10:35:14,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 10:35:14,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:14,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 10:35:14,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=913, Unknown=0, NotChecked=0, Total=992 [2019-12-07 10:35:14,817 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 32 states. [2019-12-07 10:35:17,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:17,036 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2019-12-07 10:35:17,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 10:35:17,037 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2019-12-07 10:35:17,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:17,038 INFO L225 Difference]: With dead ends: 102 [2019-12-07 10:35:17,038 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 10:35:17,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=269, Invalid=2181, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 10:35:17,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 10:35:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. [2019-12-07 10:35:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 10:35:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2019-12-07 10:35:17,041 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 41 [2019-12-07 10:35:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:17,041 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2019-12-07 10:35:17,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 10:35:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2019-12-07 10:35:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 10:35:17,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:17,042 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-12-07 10:35:17,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:17,243 INFO L410 AbstractCegarLoop]: === Iteration 24 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:17,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:17,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1593122816, now seen corresponding path program 1 times [2019-12-07 10:35:17,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:17,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603250107] [2019-12-07 10:35:17,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:17,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603250107] [2019-12-07 10:35:17,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982769365] [2019-12-07 10:35:17,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:17,773 INFO L264 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 76 conjunts are in the unsatisfiable core [2019-12-07 10:35:17,774 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:17,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:17,864 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:35:17,865 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:17,869 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:17,869 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:17,869 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 10:35:17,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:35:17,925 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:17,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:17,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:35:17,936 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:17,943 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:17,944 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:17,944 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2019-12-07 10:35:17,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:17,985 INFO L377 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 23 treesize of output 22 [2019-12-07 10:35:17,985 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:17,998 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:18,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:18,001 INFO L377 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 23 treesize of output 22 [2019-12-07 10:35:18,001 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:18,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:18,012 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:18,012 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2019-12-07 10:35:18,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:18,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:18,063 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:35:18,070 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:18,070 INFO L377 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 1 case distinctions, treesize of input 101 treesize of output 94 [2019-12-07 10:35:18,071 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:18,104 INFO L614 ElimStorePlain]: treesize reduction 30, result has 80.5 percent of original size [2019-12-07 10:35:18,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:18,108 INFO L377 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 0 case distinctions, treesize of input 99 treesize of output 74 [2019-12-07 10:35:18,109 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:18,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:18,125 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:18,125 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:114 [2019-12-07 10:35:19,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:19,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:19,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:19,222 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:19,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 242 treesize of output 175 [2019-12-07 10:35:19,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:19,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:19,224 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:35:19,251 INFO L614 ElimStorePlain]: treesize reduction 30, result has 78.7 percent of original size [2019-12-07 10:35:19,267 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:19,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 88 [2019-12-07 10:35:19,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:19,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:19,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:19,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:19,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:19,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:19,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:19,274 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:19,279 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:19,279 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:19,280 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:256, output treesize:14 [2019-12-07 10:35:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:19,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:19,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2019-12-07 10:35:19,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071076685] [2019-12-07 10:35:19,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 10:35:19,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:19,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 10:35:19,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1611, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 10:35:19,386 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 42 states. [2019-12-07 10:35:20,799 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-12-07 10:35:21,334 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 98 [2019-12-07 10:35:22,006 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-12-07 10:35:22,244 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2019-12-07 10:35:22,626 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 132 [2019-12-07 10:35:22,952 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 133 [2019-12-07 10:35:23,288 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 135 [2019-12-07 10:35:23,518 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-12-07 10:35:23,836 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 138 [2019-12-07 10:35:24,123 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2019-12-07 10:35:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:25,211 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2019-12-07 10:35:25,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:35:25,212 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-12-07 10:35:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:25,213 INFO L225 Difference]: With dead ends: 113 [2019-12-07 10:35:25,213 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 10:35:25,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=347, Invalid=3435, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 10:35:25,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 10:35:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2019-12-07 10:35:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 10:35:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2019-12-07 10:35:25,219 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 41 [2019-12-07 10:35:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:25,220 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2019-12-07 10:35:25,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 10:35:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2019-12-07 10:35:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 10:35:25,220 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:25,221 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-12-07 10:35:25,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:25,422 INFO L410 AbstractCegarLoop]: === Iteration 25 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:25,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:25,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1982668905, now seen corresponding path program 1 times [2019-12-07 10:35:25,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:25,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574370722] [2019-12-07 10:35:25,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:35:25,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574370722] [2019-12-07 10:35:25,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912909452] [2019-12-07 10:35:25,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:25,573 INFO L264 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 10:35:25,574 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:25,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 10:35:25,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:25,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:25,579 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:25,580 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-12-07 10:35:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:35:25,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:25,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-12-07 10:35:25,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76413317] [2019-12-07 10:35:25,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:35:25,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:25,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:35:25,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:35:25,583 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 9 states. [2019-12-07 10:35:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:25,876 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-12-07 10:35:25,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:35:25,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-12-07 10:35:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:25,877 INFO L225 Difference]: With dead ends: 99 [2019-12-07 10:35:25,877 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 10:35:25,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:35:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 10:35:25,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-12-07 10:35:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 10:35:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-12-07 10:35:25,879 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 43 [2019-12-07 10:35:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:25,879 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-12-07 10:35:25,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:35:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-12-07 10:35:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 10:35:25,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:25,880 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-12-07 10:35:26,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:26,080 INFO L410 AbstractCegarLoop]: === Iteration 26 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:26,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:26,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1982668906, now seen corresponding path program 1 times [2019-12-07 10:35:26,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:26,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637189553] [2019-12-07 10:35:26,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:35:26,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637189553] [2019-12-07 10:35:26,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123755577] [2019-12-07 10:35:26,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:26,336 INFO L264 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 10:35:26,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:26,388 INFO L377 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 23 treesize of output 15 [2019-12-07 10:35:26,389 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:26,392 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:26,393 INFO L377 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 19 treesize of output 11 [2019-12-07 10:35:26,393 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:26,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:26,394 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:26,395 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2019-12-07 10:35:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:35:26,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:26,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 21 [2019-12-07 10:35:26,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938041463] [2019-12-07 10:35:26,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 10:35:26,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:26,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 10:35:26,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:35:26,464 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 22 states. [2019-12-07 10:35:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:27,624 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-12-07 10:35:27,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 10:35:27,624 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2019-12-07 10:35:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:27,625 INFO L225 Difference]: With dead ends: 107 [2019-12-07 10:35:27,625 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 10:35:27,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=344, Invalid=1912, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 10:35:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 10:35:27,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2019-12-07 10:35:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 10:35:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2019-12-07 10:35:27,628 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 43 [2019-12-07 10:35:27,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:27,628 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2019-12-07 10:35:27,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 10:35:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2019-12-07 10:35:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 10:35:27,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:27,629 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-12-07 10:35:27,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:27,829 INFO L410 AbstractCegarLoop]: === Iteration 27 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:27,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:27,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1336069940, now seen corresponding path program 1 times [2019-12-07 10:35:27,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:27,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54566540] [2019-12-07 10:35:27,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:35:27,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54566540] [2019-12-07 10:35:27,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:27,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:35:27,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551919841] [2019-12-07 10:35:27,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:35:27,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:27,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:35:27,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:35:27,887 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 8 states. [2019-12-07 10:35:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:28,070 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2019-12-07 10:35:28,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:35:28,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-12-07 10:35:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:28,070 INFO L225 Difference]: With dead ends: 103 [2019-12-07 10:35:28,071 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 10:35:28,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:35:28,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 10:35:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-12-07 10:35:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 10:35:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2019-12-07 10:35:28,073 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 44 [2019-12-07 10:35:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:28,073 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2019-12-07 10:35:28,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:35:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2019-12-07 10:35:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:35:28,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:28,074 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-12-07 10:35:28,074 INFO L410 AbstractCegarLoop]: === Iteration 28 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:28,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1620607627, now seen corresponding path program 2 times [2019-12-07 10:35:28,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:28,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782539069] [2019-12-07 10:35:28,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:29,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782539069] [2019-12-07 10:35:29,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252586262] [2019-12-07 10:35:29,028 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:29,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:35:29,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:35:29,111 INFO L264 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 87 conjunts are in the unsatisfiable core [2019-12-07 10:35:29,112 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:29,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:35:29,183 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,189 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:35:29,191 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,196 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,197 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,197 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-12-07 10:35:29,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:29,201 INFO L377 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 23 treesize of output 22 [2019-12-07 10:35:29,201 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:29,213 INFO L377 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 23 treesize of output 22 [2019-12-07 10:35:29,213 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,221 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,221 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2019-12-07 10:35:29,307 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:35:29,307 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,315 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,315 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:47 [2019-12-07 10:35:29,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:29,372 INFO L377 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 34 treesize of output 25 [2019-12-07 10:35:29,372 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:29,388 INFO L377 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 34 treesize of output 25 [2019-12-07 10:35:29,388 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,398 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,398 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,398 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:50 [2019-12-07 10:35:29,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:29,451 INFO L377 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 32 treesize of output 34 [2019-12-07 10:35:29,451 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:29,468 INFO L377 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 32 treesize of output 34 [2019-12-07 10:35:29,468 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,481 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,481 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,481 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:68 [2019-12-07 10:35:29,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:29,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:29,542 INFO L377 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 41 treesize of output 46 [2019-12-07 10:35:29,543 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,561 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:29,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:29,565 INFO L377 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 41 treesize of output 46 [2019-12-07 10:35:29,565 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,582 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,582 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,582 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2019-12-07 10:35:29,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:29,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:29,655 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:35:29,656 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:35:29,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 108 [2019-12-07 10:35:29,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,706 INFO L614 ElimStorePlain]: treesize reduction 60, result has 66.5 percent of original size [2019-12-07 10:35:29,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:29,710 INFO L377 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 0 case distinctions, treesize of input 68 treesize of output 57 [2019-12-07 10:35:29,711 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,724 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:29,724 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:29,724 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:142, output treesize:96 [2019-12-07 10:35:31,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:31,006 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:35:31,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:31,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:31,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:31,009 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:35:31,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:31,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 240 treesize of output 181 [2019-12-07 10:35:31,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:31,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,110 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:35:31,148 INFO L614 ElimStorePlain]: treesize reduction 137, result has 38.3 percent of original size [2019-12-07 10:35:31,171 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:31,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 97 [2019-12-07 10:35:31,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:31,173 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:31,176 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:31,177 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:31,177 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:254, output treesize:7 [2019-12-07 10:35:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:31,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:31,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 47 [2019-12-07 10:35:31,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811034158] [2019-12-07 10:35:31,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-07 10:35:31,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:31,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-07 10:35:31,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2025, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 10:35:31,236 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 47 states. [2019-12-07 10:35:32,536 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-07 10:35:32,828 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2019-12-07 10:35:33,503 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 124 [2019-12-07 10:35:33,863 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-12-07 10:35:34,091 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-07 10:35:34,406 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 126 [2019-12-07 10:35:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:34,782 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-12-07 10:35:34,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 10:35:34,783 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 45 [2019-12-07 10:35:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:34,783 INFO L225 Difference]: With dead ends: 104 [2019-12-07 10:35:34,783 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 10:35:34,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=353, Invalid=4203, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 10:35:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 10:35:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-12-07 10:35:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 10:35:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2019-12-07 10:35:34,787 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 45 [2019-12-07 10:35:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:34,787 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2019-12-07 10:35:34,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-07 10:35:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2019-12-07 10:35:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:35:34,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:34,787 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-12-07 10:35:34,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:34,988 INFO L410 AbstractCegarLoop]: === Iteration 29 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:34,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:34,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1620660215, now seen corresponding path program 1 times [2019-12-07 10:35:34,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:34,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453098459] [2019-12-07 10:35:34,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:35,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453098459] [2019-12-07 10:35:35,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028264495] [2019-12-07 10:35:35,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:35,376 INFO L264 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-07 10:35:35,378 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:35,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:35,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:35:35,401 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:35,403 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:35,404 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:35,404 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:10 [2019-12-07 10:35:35,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:35:35,427 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:35,432 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:35,433 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:35,433 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 10:35:35,464 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:35:35,464 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 10:35:35,465 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:35,470 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:35,470 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:35,470 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-12-07 10:35:35,540 INFO L343 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-12-07 10:35:35,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 111 [2019-12-07 10:35:35,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:35,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:35,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:35,542 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 10:35:35,565 INFO L614 ElimStorePlain]: treesize reduction 164, result has 21.9 percent of original size [2019-12-07 10:35:35,565 INFO L534 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. [2019-12-07 10:35:35,565 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2019-12-07 10:35:35,908 INFO L377 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 93 treesize of output 73 [2019-12-07 10:35:35,908 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:35,916 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:35,916 INFO L534 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. [2019-12-07 10:35:35,917 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:100, output treesize:77 [2019-12-07 10:35:36,070 INFO L343 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2019-12-07 10:35:36,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 99 [2019-12-07 10:35:36,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:36,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:36,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:36,072 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-12-07 10:35:36,084 INFO L614 ElimStorePlain]: treesize reduction 120, result has 4.0 percent of original size [2019-12-07 10:35:36,084 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:36,085 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:5 [2019-12-07 10:35:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:36,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:36,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 33 [2019-12-07 10:35:36,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918701074] [2019-12-07 10:35:36,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 10:35:36,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:36,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 10:35:36,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1048, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 10:35:36,095 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 34 states. [2019-12-07 10:35:37,409 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-12-07 10:35:37,715 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-12-07 10:35:38,314 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2019-12-07 10:35:38,752 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-12-07 10:35:39,437 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2019-12-07 10:35:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:40,349 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2019-12-07 10:35:40,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 10:35:40,350 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2019-12-07 10:35:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:40,350 INFO L225 Difference]: With dead ends: 103 [2019-12-07 10:35:40,350 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 10:35:40,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=265, Invalid=2491, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 10:35:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 10:35:40,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-12-07 10:35:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 10:35:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-12-07 10:35:40,353 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 45 [2019-12-07 10:35:40,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:40,353 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-12-07 10:35:40,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 10:35:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-12-07 10:35:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 10:35:40,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:40,354 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-12-07 10:35:40,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:40,555 INFO L410 AbstractCegarLoop]: === Iteration 30 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:40,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1401340656, now seen corresponding path program 1 times [2019-12-07 10:35:40,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:40,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151857821] [2019-12-07 10:35:40,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:40,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151857821] [2019-12-07 10:35:40,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659192668] [2019-12-07 10:35:40,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:41,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-07 10:35:41,014 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:41,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:41,071 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:41,071 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:35:41,072 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:41,075 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:41,075 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:41,075 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-12-07 10:35:41,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 10:35:41,106 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:41,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:41,111 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:41,112 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 10:35:41,139 INFO L377 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 19 treesize of output 18 [2019-12-07 10:35:41,139 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:41,144 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:41,144 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:41,144 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-12-07 10:35:41,191 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:41,192 INFO L377 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 45 treesize of output 94 [2019-12-07 10:35:41,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:41,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:41,193 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:41,204 INFO L614 ElimStorePlain]: treesize reduction 22, result has 62.7 percent of original size [2019-12-07 10:35:41,204 INFO L534 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. [2019-12-07 10:35:41,204 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2019-12-07 10:35:41,508 INFO L377 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 25 treesize of output 17 [2019-12-07 10:35:41,509 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:41,510 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:41,510 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:41,510 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2019-12-07 10:35:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:41,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:41,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 39 [2019-12-07 10:35:41,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264123381] [2019-12-07 10:35:41,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 10:35:41,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:41,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 10:35:41,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 10:35:41,547 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 39 states. [2019-12-07 10:35:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:42,908 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2019-12-07 10:35:42,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:35:42,909 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 47 [2019-12-07 10:35:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:42,910 INFO L225 Difference]: With dead ends: 103 [2019-12-07 10:35:42,910 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 10:35:42,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=334, Invalid=2972, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 10:35:42,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 10:35:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-12-07 10:35:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 10:35:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2019-12-07 10:35:42,914 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 47 [2019-12-07 10:35:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:42,914 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2019-12-07 10:35:42,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 10:35:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2019-12-07 10:35:42,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 10:35:42,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:42,914 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:43,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:43,115 INFO L410 AbstractCegarLoop]: === Iteration 31 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:43,115 INFO L82 PathProgramCache]: Analyzing trace with hash -474472781, now seen corresponding path program 1 times [2019-12-07 10:35:43,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:43,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780301539] [2019-12-07 10:35:43,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 10:35:43,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780301539] [2019-12-07 10:35:43,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110260759] [2019-12-07 10:35:43,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:43,242 INFO L264 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:35:43,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 10:35:43,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:43,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2019-12-07 10:35:43,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276683952] [2019-12-07 10:35:43,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:35:43,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:43,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:35:43,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:35:43,247 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 8 states. [2019-12-07 10:35:43,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:43,379 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2019-12-07 10:35:43,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:35:43,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-12-07 10:35:43,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:43,380 INFO L225 Difference]: With dead ends: 100 [2019-12-07 10:35:43,380 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 10:35:43,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:35:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 10:35:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-07 10:35:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 10:35:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-12-07 10:35:43,382 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 51 [2019-12-07 10:35:43,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:43,383 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-12-07 10:35:43,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:35:43,383 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-12-07 10:35:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 10:35:43,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:43,383 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:43,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:43,585 INFO L410 AbstractCegarLoop]: === Iteration 32 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:43,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:43,585 INFO L82 PathProgramCache]: Analyzing trace with hash -701690128, now seen corresponding path program 1 times [2019-12-07 10:35:43,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:43,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554689404] [2019-12-07 10:35:43,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:35:43,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554689404] [2019-12-07 10:35:43,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032849788] [2019-12-07 10:35:43,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:43,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 10:35:43,787 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:43,809 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:43,809 INFO L377 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-07 10:35:43,810 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:43,821 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 10:35:43,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:43,821 INFO L534 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. [2019-12-07 10:35:43,821 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:18 [2019-12-07 10:35:43,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:43,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:43,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 10:35:43,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:43,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-12-07 10:35:43,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307474602] [2019-12-07 10:35:43,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 10:35:43,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:43,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 10:35:43,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:35:43,913 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 19 states. [2019-12-07 10:35:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:44,529 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2019-12-07 10:35:44,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 10:35:44,529 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2019-12-07 10:35:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:44,530 INFO L225 Difference]: With dead ends: 126 [2019-12-07 10:35:44,530 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 10:35:44,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992 [2019-12-07 10:35:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 10:35:44,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2019-12-07 10:35:44,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 10:35:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2019-12-07 10:35:44,532 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 53 [2019-12-07 10:35:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:44,532 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2019-12-07 10:35:44,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 10:35:44,532 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2019-12-07 10:35:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 10:35:44,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:44,533 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:44,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:44,734 INFO L410 AbstractCegarLoop]: === Iteration 33 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:35:44,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:44,734 INFO L82 PathProgramCache]: Analyzing trace with hash -277557487, now seen corresponding path program 1 times [2019-12-07 10:35:44,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:35:44,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611684035] [2019-12-07 10:35:44,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:35:45,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611684035] [2019-12-07 10:35:45,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606044473] [2019-12-07 10:35:45,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:45,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-07 10:35:45,104 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:45,261 INFO L377 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 25 treesize of output 17 [2019-12-07 10:35:45,261 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:35:45,267 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:45,269 INFO L377 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 11 treesize of output 7 [2019-12-07 10:35:45,269 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:45,274 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:45,274 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:45,274 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2019-12-07 10:35:51,431 WARN L192 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 10:35:51,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:51,438 INFO L377 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 46 treesize of output 37 [2019-12-07 10:35:51,439 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:51,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:51,461 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:51,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 73 [2019-12-07 10:35:51,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:51,462 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:51,479 INFO L614 ElimStorePlain]: treesize reduction 22, result has 74.1 percent of original size [2019-12-07 10:35:51,479 INFO L534 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. [2019-12-07 10:35:51,479 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2019-12-07 10:35:51,656 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:51,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2019-12-07 10:35:51,656 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:51,670 INFO L614 ElimStorePlain]: treesize reduction 14, result has 75.0 percent of original size [2019-12-07 10:35:51,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:35:51,673 INFO L377 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 19 [2019-12-07 10:35:51,673 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:51,677 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:51,677 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:51,677 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:13 [2019-12-07 10:35:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:35:51,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:51,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2019-12-07 10:35:51,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337162288] [2019-12-07 10:35:51,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 10:35:51,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:35:51,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 10:35:51,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1291, Unknown=4, NotChecked=0, Total=1406 [2019-12-07 10:35:51,719 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 38 states. [2019-12-07 10:36:21,733 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 10:37:20,262 WARN L192 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-12-07 10:37:39,571 WARN L192 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-12-07 10:38:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:22,463 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2019-12-07 10:38:22,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 10:38:22,463 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2019-12-07 10:38:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:22,464 INFO L225 Difference]: With dead ends: 150 [2019-12-07 10:38:22,464 INFO L226 Difference]: Without dead ends: 150 [2019-12-07 10:38:22,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 74.5s TimeCoverageRelationStatistics Valid=603, Invalid=4451, Unknown=58, NotChecked=0, Total=5112 [2019-12-07 10:38:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-12-07 10:38:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-12-07 10:38:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 10:38:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2019-12-07 10:38:22,468 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 54 [2019-12-07 10:38:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:22,468 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2019-12-07 10:38:22,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 10:38:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2019-12-07 10:38:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 10:38:22,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:22,468 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:22,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:38:22,669 INFO L410 AbstractCegarLoop]: === Iteration 34 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:38:22,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:22,670 INFO L82 PathProgramCache]: Analyzing trace with hash -277557488, now seen corresponding path program 1 times [2019-12-07 10:38:22,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:38:22,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577877188] [2019-12-07 10:38:22,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:23,436 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:38:23,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577877188] [2019-12-07 10:38:23,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89208828] [2019-12-07 10:38:23,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:38:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:23,510 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 72 conjunts are in the unsatisfiable core [2019-12-07 10:38:23,511 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:23,669 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:23,669 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 10:38:23,669 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:23,674 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:23,674 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:23,674 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2019-12-07 10:38:23,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 10:38:23,757 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:23,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:23,766 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:23,766 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 10:38:23,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:38:23,819 INFO L377 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 23 treesize of output 22 [2019-12-07 10:38:23,819 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:23,829 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:23,829 INFO L534 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. [2019-12-07 10:38:23,829 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2019-12-07 10:38:23,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:38:23,914 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:23,914 INFO L377 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 2 case distinctions, treesize of input 55 treesize of output 110 [2019-12-07 10:38:23,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:23,915 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:23,940 INFO L614 ElimStorePlain]: treesize reduction 46, result has 56.2 percent of original size [2019-12-07 10:38:23,941 INFO L534 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. [2019-12-07 10:38:23,941 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:59 [2019-12-07 10:38:28,520 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-12-07 10:38:30,602 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-12-07 10:38:32,530 WARN L192 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 10:38:32,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:38:32,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-12-07 10:38:32,539 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:32,569 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:32,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:38:32,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:38:32,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:38:32,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:38:32,576 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:38:32,674 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:32,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 114 treesize of output 313 [2019-12-07 10:38:32,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,734 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:38:32,855 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2019-12-07 10:38:32,856 INFO L614 ElimStorePlain]: treesize reduction 158, result has 44.0 percent of original size [2019-12-07 10:38:32,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,862 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-12-07 10:38:32,862 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:129, output treesize:153 [2019-12-07 10:38:32,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:32,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:32,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:33,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:33,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:33,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:33,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:33,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:33,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:33,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:53,566 WARN L192 SmtUtils]: Spent 18.17 s on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-12-07 10:39:00,849 WARN L192 SmtUtils]: Spent 4.73 s on a formula simplification that was a NOOP. DAG size: 174 [2019-12-07 10:39:04,052 WARN L192 SmtUtils]: Spent 2.94 s on a formula simplification that was a NOOP. DAG size: 174 [2019-12-07 10:39:04,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 10:39:04,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,075 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:39:04,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:04,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 80 treesize of output 87 [2019-12-07 10:39:04,093 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:04,329 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 175 [2019-12-07 10:39:04,329 INFO L614 ElimStorePlain]: treesize reduction 32, result has 94.2 percent of original size [2019-12-07 10:39:04,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:39:04,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,359 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:04,359 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 101 treesize of output 105 [2019-12-07 10:39:04,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:39:04,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:39:04,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:39:04,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:39:04,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:39:04,361 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:04,575 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 150 [2019-12-07 10:39:04,576 INFO L614 ElimStorePlain]: treesize reduction 89, result has 82.8 percent of original size [2019-12-07 10:39:04,581 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:39:04,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:04,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 128 treesize of output 112 [2019-12-07 10:39:04,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:39:04,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:39:04,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:39:04,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:39:04,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:39:04,607 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:04,765 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 122 [2019-12-07 10:39:04,766 INFO L614 ElimStorePlain]: treesize reduction 24, result has 92.8 percent of original size [2019-12-07 10:39:04,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,776 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:39:04,792 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:04,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 78 [2019-12-07 10:39:04,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:39:04,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:39:04,794 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:04,911 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 10:39:04,911 INFO L614 ElimStorePlain]: treesize reduction 4, result has 98.1 percent of original size [2019-12-07 10:39:04,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,921 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:39:04,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:04,933 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:04,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 71 [2019-12-07 10:39:04,934 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:05,025 INFO L614 ElimStorePlain]: treesize reduction 16, result has 89.9 percent of original size [2019-12-07 10:39:05,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 22 dim-0 vars, 5 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2019-12-07 10:39:05,026 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 27 variables, input treesize:583, output treesize:56 [2019-12-07 10:39:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:39:05,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:39:05,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 56 [2019-12-07 10:39:05,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022629502] [2019-12-07 10:39:05,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-12-07 10:39:05,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:39:05,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-12-07 10:39:05,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=3039, Unknown=2, NotChecked=0, Total=3192 [2019-12-07 10:39:05,142 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 57 states. [2019-12-07 10:39:06,468 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-12-07 10:39:07,153 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-12-07 10:39:12,709 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-12-07 10:39:12,928 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-12-07 10:39:13,427 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-12-07 10:39:17,664 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-12-07 10:39:19,198 WARN L192 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 10:39:21,296 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 10:39:23,103 WARN L192 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 10:39:38,910 WARN L192 SmtUtils]: Spent 11.50 s on a formula simplification that was a NOOP. DAG size: 194 [2019-12-07 10:39:54,231 WARN L192 SmtUtils]: Spent 11.09 s on a formula simplification. DAG size of input: 274 DAG size of output: 198 [2019-12-07 10:40:12,666 WARN L192 SmtUtils]: Spent 13.66 s on a formula simplification. DAG size of input: 289 DAG size of output: 210 [2019-12-07 10:40:22,362 WARN L192 SmtUtils]: Spent 5.44 s on a formula simplification. DAG size of input: 301 DAG size of output: 221 [2019-12-07 10:40:27,295 WARN L192 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 234 [2019-12-07 10:40:34,291 WARN L192 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 328 DAG size of output: 237 [2019-12-07 10:40:41,311 WARN L192 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 327 DAG size of output: 239 [2019-12-07 10:40:48,398 WARN L192 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 341 DAG size of output: 253 [2019-12-07 10:41:04,661 WARN L192 SmtUtils]: Spent 5.86 s on a formula simplification. DAG size of input: 328 DAG size of output: 222 [2019-12-07 10:41:22,222 WARN L192 SmtUtils]: Spent 9.09 s on a formula simplification. DAG size of input: 316 DAG size of output: 215 [2019-12-07 10:41:27,228 WARN L192 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 241 [2019-12-07 10:41:37,096 WARN L192 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 334 DAG size of output: 223 [2019-12-07 10:41:44,070 WARN L192 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 237 [2019-12-07 10:41:55,072 WARN L192 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 235 [2019-12-07 10:42:01,353 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 10:42:10,945 WARN L192 SmtUtils]: Spent 5.36 s on a formula simplification. DAG size of input: 289 DAG size of output: 213 [2019-12-07 10:42:15,146 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 82 [2019-12-07 10:42:17,275 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 61 [2019-12-07 10:42:28,318 WARN L192 SmtUtils]: Spent 6.76 s on a formula simplification. DAG size of input: 300 DAG size of output: 221 [2019-12-07 10:42:32,986 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-12-07 10:42:34,677 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-12-07 10:42:35,046 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 98 [2019-12-07 10:42:35,261 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 98 [2019-12-07 10:42:35,675 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-07 10:42:37,961 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2019-12-07 10:42:41,815 WARN L192 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 10:42:41,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:41,985 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2019-12-07 10:42:41,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-07 10:42:41,985 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 54 [2019-12-07 10:42:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:41,986 INFO L225 Difference]: With dead ends: 160 [2019-12-07 10:42:41,986 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 10:42:41,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3139 ImplicationChecksByTransitivity, 191.1s TimeCoverageRelationStatistics Valid=1360, Invalid=12893, Unknown=27, NotChecked=0, Total=14280 [2019-12-07 10:42:41,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 10:42:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 125. [2019-12-07 10:42:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 10:42:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-12-07 10:42:41,992 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 54 [2019-12-07 10:42:41,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:41,992 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-12-07 10:42:41,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-12-07 10:42:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-12-07 10:42:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 10:42:41,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:41,993 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:42,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:42,193 INFO L410 AbstractCegarLoop]: === Iteration 35 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:42:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2069870615, now seen corresponding path program 1 times [2019-12-07 10:42:42,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:42,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425978694] [2019-12-07 10:42:42,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:42:42,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425978694] [2019-12-07 10:42:42,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498657152] [2019-12-07 10:42:42,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:42,623 INFO L264 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 10:42:42,624 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:42,686 INFO L377 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 23 treesize of output 15 [2019-12-07 10:42:42,686 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:42,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:42,692 INFO L377 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 28 treesize of output 16 [2019-12-07 10:42:42,692 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:42,696 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:42,697 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:42,697 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2019-12-07 10:42:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:42:42,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:42:42,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 25 [2019-12-07 10:42:42,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996726241] [2019-12-07 10:42:42,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:42:42,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:42,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:42:42,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:42:42,761 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 6 states. [2019-12-07 10:42:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:42,917 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2019-12-07 10:42:42,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:42:42,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-07 10:42:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:42,918 INFO L225 Difference]: With dead ends: 127 [2019-12-07 10:42:42,918 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 10:42:42,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:42:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 10:42:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-12-07 10:42:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 10:42:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2019-12-07 10:42:42,921 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 58 [2019-12-07 10:42:42,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:42,921 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2019-12-07 10:42:42,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:42:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2019-12-07 10:42:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 10:42:42,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:42,922 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:43,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:43,122 INFO L410 AbstractCegarLoop]: === Iteration 36 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:42:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:43,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2069439665, now seen corresponding path program 1 times [2019-12-07 10:42:43,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:42:43,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561675920] [2019-12-07 10:42:43,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:42:43,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561675920] [2019-12-07 10:42:43,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296303582] [2019-12-07 10:42:43,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:43,466 INFO L264 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 10:42:43,467 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:43,540 INFO L377 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 9 treesize of output 5 [2019-12-07 10:42:43,540 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:43,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:43,543 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:43,543 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:3 [2019-12-07 10:42:45,255 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_remove_last_~snd_to_last~0.base Int) (dll_remove_last_~snd_to_last~0.offset Int)) (and (<= dll_remove_last_~snd_to_last~0.base (select (select |c_old(#memory_$Pointer$.base)| |c_dll_remove_last_#in~head.base|) |c_dll_remove_last_#in~head.offset|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| dll_remove_last_~snd_to_last~0.base (store (select |c_old(#memory_$Pointer$.base)| dll_remove_last_~snd_to_last~0.base) (+ dll_remove_last_~snd_to_last~0.offset 4) 0))))) is different from true [2019-12-07 10:42:45,271 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:45,271 INFO L377 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 1 case distinctions, treesize of input 30 treesize of output 53 [2019-12-07 10:42:45,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:42:45,272 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:45,292 INFO L614 ElimStorePlain]: treesize reduction 34, result has 48.5 percent of original size [2019-12-07 10:42:45,292 INFO L534 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. [2019-12-07 10:42:45,292 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-12-07 10:42:45,414 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:45,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2019-12-07 10:42:45,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:42:45,414 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 10:42:45,430 INFO L614 ElimStorePlain]: treesize reduction 33, result has 29.8 percent of original size [2019-12-07 10:42:45,430 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:42:45,430 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-12-07 10:42:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:42:45,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:42:45,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 30 [2019-12-07 10:42:45,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830316865] [2019-12-07 10:42:45,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 10:42:45,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:42:45,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 10:42:45,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=776, Unknown=1, NotChecked=56, Total=930 [2019-12-07 10:42:45,439 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand 31 states. [2019-12-07 10:42:57,692 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 32 [2019-12-07 10:43:27,720 WARN L192 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 10:44:05,054 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 10:44:28,266 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 10:44:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:47,495 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2019-12-07 10:44:47,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 10:44:47,495 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-12-07 10:44:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:47,496 INFO L225 Difference]: With dead ends: 151 [2019-12-07 10:44:47,496 INFO L226 Difference]: Without dead ends: 151 [2019-12-07 10:44:47,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 123.2s TimeCoverageRelationStatistics Valid=521, Invalid=3069, Unknown=74, NotChecked=118, Total=3782 [2019-12-07 10:44:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-12-07 10:44:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 128. [2019-12-07 10:44:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-07 10:44:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2019-12-07 10:44:47,500 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 58 [2019-12-07 10:44:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:47,500 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2019-12-07 10:44:47,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 10:44:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2019-12-07 10:44:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:44:47,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:47,501 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:47,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:47,702 INFO L410 AbstractCegarLoop]: === Iteration 37 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:44:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:47,702 INFO L82 PathProgramCache]: Analyzing trace with hash 161662388, now seen corresponding path program 1 times [2019-12-07 10:44:47,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:44:47,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133517787] [2019-12-07 10:44:47,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:44:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 10:44:47,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133517787] [2019-12-07 10:44:47,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391856258] [2019-12-07 10:44:47,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:47,901 INFO L264 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 10:44:47,902 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:47,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:44:47,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 10:44:47,920 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:47,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:47,924 INFO L534 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. [2019-12-07 10:44:47,924 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-12-07 10:44:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 10:44:47,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:44:47,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 13 [2019-12-07 10:44:47,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588837745] [2019-12-07 10:44:47,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:44:47,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:44:47,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:44:47,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:44:47,943 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand 8 states. [2019-12-07 10:44:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:48,077 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2019-12-07 10:44:48,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:44:48,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-07 10:44:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:48,078 INFO L225 Difference]: With dead ends: 129 [2019-12-07 10:44:48,078 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 10:44:48,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:44:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 10:44:48,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2019-12-07 10:44:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 10:44:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2019-12-07 10:44:48,081 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 60 [2019-12-07 10:44:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:48,081 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2019-12-07 10:44:48,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:44:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2019-12-07 10:44:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:44:48,081 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:48,081 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:48,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:48,282 INFO L410 AbstractCegarLoop]: === Iteration 38 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:44:48,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:48,283 INFO L82 PathProgramCache]: Analyzing trace with hash -703974900, now seen corresponding path program 1 times [2019-12-07 10:44:48,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:44:48,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124703667] [2019-12-07 10:44:48,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:44:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:44:49,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124703667] [2019-12-07 10:44:49,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481246490] [2019-12-07 10:44:49,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:49,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 61 conjunts are in the unsatisfiable core [2019-12-07 10:44:49,090 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:49,452 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:49,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 77 [2019-12-07 10:44:49,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:49,453 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:44:49,483 INFO L614 ElimStorePlain]: treesize reduction 42, result has 66.1 percent of original size [2019-12-07 10:44:49,483 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:44:49,483 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:82 [2019-12-07 10:44:49,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:49,571 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:49,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 49 [2019-12-07 10:44:49,572 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:49,585 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:49,585 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 78 [2019-12-07 10:44:49,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:49,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:49,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:49,586 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 10:44:49,608 INFO L614 ElimStorePlain]: treesize reduction 115, result has 29.0 percent of original size [2019-12-07 10:44:49,608 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:49,609 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:106, output treesize:47 [2019-12-07 10:44:49,838 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:49,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 59 [2019-12-07 10:44:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:49,839 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:44:49,851 INFO L614 ElimStorePlain]: treesize reduction 18, result has 66.0 percent of original size [2019-12-07 10:44:49,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:44:49,853 INFO L377 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 27 treesize of output 12 [2019-12-07 10:44:49,854 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:49,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:49,857 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:49,857 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:7 [2019-12-07 10:44:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:44:49,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:44:49,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 42 [2019-12-07 10:44:49,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088497954] [2019-12-07 10:44:49,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 10:44:49,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:44:49,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 10:44:49,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1622, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 10:44:49,904 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 42 states. [2019-12-07 10:44:51,772 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-12-07 10:44:52,167 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2019-12-07 10:44:52,483 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-12-07 10:44:53,002 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-07 10:44:54,063 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2019-12-07 10:44:54,445 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 70 [2019-12-07 10:44:55,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:55,698 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-12-07 10:44:55,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 10:44:55,698 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 62 [2019-12-07 10:44:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:55,699 INFO L225 Difference]: With dead ends: 113 [2019-12-07 10:44:55,699 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 10:44:55,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=324, Invalid=3458, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 10:44:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 10:44:55,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2019-12-07 10:44:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 10:44:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-12-07 10:44:55,701 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 62 [2019-12-07 10:44:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:55,702 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-12-07 10:44:55,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 10:44:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-12-07 10:44:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 10:44:55,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:55,702 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:55,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:55,903 INFO L410 AbstractCegarLoop]: === Iteration 39 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:44:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1186420541, now seen corresponding path program 1 times [2019-12-07 10:44:55,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:44:55,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895600848] [2019-12-07 10:44:55,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:44:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:44:55,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895600848] [2019-12-07 10:44:55,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:44:55,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:44:55,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834233563] [2019-12-07 10:44:55,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:44:55,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:44:55,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:44:55,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:44:55,966 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 9 states. [2019-12-07 10:44:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:56,090 INFO L93 Difference]: Finished difference Result 70 states and 69 transitions. [2019-12-07 10:44:56,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:44:56,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-07 10:44:56,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:56,091 INFO L225 Difference]: With dead ends: 70 [2019-12-07 10:44:56,091 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 10:44:56,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:44:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 10:44:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-12-07 10:44:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 10:44:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 69 transitions. [2019-12-07 10:44:56,093 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 69 transitions. Word has length 68 [2019-12-07 10:44:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:56,093 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 69 transitions. [2019-12-07 10:44:56,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:44:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 69 transitions. [2019-12-07 10:44:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:44:56,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:56,094 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:56,094 INFO L410 AbstractCegarLoop]: === Iteration 40 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:44:56,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1839270409, now seen corresponding path program 1 times [2019-12-07 10:44:56,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:44:56,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409432286] [2019-12-07 10:44:56,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:44:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 10:44:56,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409432286] [2019-12-07 10:44:56,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:44:56,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:44:56,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923378793] [2019-12-07 10:44:56,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:44:56,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:44:56,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:44:56,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:44:56,177 INFO L87 Difference]: Start difference. First operand 70 states and 69 transitions. Second operand 9 states. [2019-12-07 10:44:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:44:56,341 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2019-12-07 10:44:56,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:44:56,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-07 10:44:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:44:56,342 INFO L225 Difference]: With dead ends: 68 [2019-12-07 10:44:56,342 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 10:44:56,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:44:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 10:44:56,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-07 10:44:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 10:44:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 67 transitions. [2019-12-07 10:44:56,344 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 67 transitions. Word has length 67 [2019-12-07 10:44:56,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:44:56,344 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 67 transitions. [2019-12-07 10:44:56,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:44:56,344 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2019-12-07 10:44:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:44:56,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:44:56,345 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:44:56,345 INFO L410 AbstractCegarLoop]: === Iteration 41 === [dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr10REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 10:44:56,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:44:56,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1839270474, now seen corresponding path program 1 times [2019-12-07 10:44:56,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:44:56,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536587587] [2019-12-07 10:44:56,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:44:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:44:57,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536587587] [2019-12-07 10:44:57,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607257531] [2019-12-07 10:44:57,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:44:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:44:57,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-07 10:44:57,847 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:44:58,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:44:58,081 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:58,091 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:58,091 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:58,091 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 10:44:58,239 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:44:58,240 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 10:44:58,240 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:44:58,268 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:44:58,269 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:44:58,269 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-12-07 10:44:58,579 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-12-07 10:44:58,579 INFO L343 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-12-07 10:44:58,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 124 [2019-12-07 10:44:58,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:44:58,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:58,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:44:58,583 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 10:44:58,678 INFO L614 ElimStorePlain]: treesize reduction 212, result has 23.5 percent of original size [2019-12-07 10:44:58,679 INFO L534 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. [2019-12-07 10:44:58,679 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:75, output treesize:65 [2019-12-07 10:45:02,226 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 26 [2019-12-07 10:45:03,010 WARN L192 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 10:45:03,013 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_31|], 20=[|v_#memory_$Pointer$.base_BEFORE_CALL_20|]} [2019-12-07 10:45:03,016 INFO L377 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 143 treesize of output 119 [2019-12-07 10:45:03,017 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:03,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:03,197 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-12-07 10:45:03,198 INFO L343 Elim1Store]: treesize reduction 12, result has 94.9 percent of original size [2019-12-07 10:45:03,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 140 treesize of output 278 [2019-12-07 10:45:03,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:03,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:03,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:04,374 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:04,447 INFO L614 ElimStorePlain]: treesize reduction 204, result has 37.2 percent of original size [2019-12-07 10:45:04,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,448 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:04,448 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:172, output treesize:121 [2019-12-07 10:45:04,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:04,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:05,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:05,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:45:05,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:45:05,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:05,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 142 treesize of output 183 [2019-12-07 10:45:05,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,128 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:05,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:45:05,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:45:05,159 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:05,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 126 [2019-12-07 10:45:05,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:45:05,170 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:05,251 INFO L614 ElimStorePlain]: treesize reduction 168, result has 40.2 percent of original size [2019-12-07 10:45:05,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:05,252 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-12-07 10:45:05,252 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:296, output treesize:148 [2019-12-07 10:45:05,472 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:45:05,479 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:05,480 INFO L534 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. [2019-12-07 10:45:05,480 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-12-07 10:45:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:45:05,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:45:05,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30] total 57 [2019-12-07 10:45:05,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731140153] [2019-12-07 10:45:05,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-12-07 10:45:05,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:45:05,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-12-07 10:45:05,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3135, Unknown=1, NotChecked=0, Total=3306 [2019-12-07 10:45:05,626 INFO L87 Difference]: Start difference. First operand 68 states and 67 transitions. Second operand 58 states. [2019-12-07 10:45:07,159 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 65 [2019-12-07 10:45:13,157 WARN L192 SmtUtils]: Spent 709.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-12-07 10:45:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:13,985 INFO L93 Difference]: Finished difference Result 67 states and 66 transitions. [2019-12-07 10:45:13,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 10:45:13,985 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 67 [2019-12-07 10:45:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:13,985 INFO L225 Difference]: With dead ends: 67 [2019-12-07 10:45:13,986 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:45:13,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=417, Invalid=6060, Unknown=3, NotChecked=0, Total=6480 [2019-12-07 10:45:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:45:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:45:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:45:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:45:13,987 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-12-07 10:45:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:13,987 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:45:13,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-12-07 10:45:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:45:13,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:45:14,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:14,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:45:14 BoogieIcfgContainer [2019-12-07 10:45:14,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:45:14,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:45:14,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:45:14,195 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:45:14,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:33:26" (3/4) ... [2019-12-07 10:45:14,197 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:45:14,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_remove_last [2019-12-07 10:45:14,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 10:45:14,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-12-07 10:45:14,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2019-12-07 10:45:14,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 10:45:14,204 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 10:45:14,204 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 10:45:14,204 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-12-07 10:45:14,208 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-12-07 10:45:14,208 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 10:45:14,208 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 10:45:14,208 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 10:45:14,239 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e05ac9ec-89c6-4b85-9af1-8416b9db88e9/bin/uautomizer/witness.graphml [2019-12-07 10:45:14,239 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:45:14,240 INFO L168 Benchmark]: Toolchain (without parser) took 708133.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 941.3 MB in the beginning and 1.0 GB in the end (delta: -79.1 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:14,240 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:45:14,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.6 MB). Free memory was 941.3 MB in the beginning and 1.1 GB in the end (delta: -110.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:14,241 INFO L168 Benchmark]: Boogie Preprocessor took 50.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:14,241 INFO L168 Benchmark]: RCFGBuilder took 359.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 987.6 MB in the end (delta: 60.9 MB). Peak memory consumption was 60.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:14,241 INFO L168 Benchmark]: TraceAbstraction took 707338.93 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Free memory was 987.6 MB in the beginning and 1.0 GB in the end (delta: -41.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:45:14,241 INFO L168 Benchmark]: Witness Printer took 44.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:14,243 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.6 MB). Free memory was 941.3 MB in the beginning and 1.1 GB in the end (delta: -110.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 359.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 987.6 MB in the end (delta: 60.9 MB). Peak memory consumption was 60.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 707338.93 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Free memory was 987.6 MB in the beginning and 1.0 GB in the end (delta: -41.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 44.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 601]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 599]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 599]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 601]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 607]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 40 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 110 locations, 40 error locations. Result: SAFE, OverallTime: 707.2s, OverallIterations: 41, TraceHistogramMax: 3, AutomataDifference: 625.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1673 SDtfs, 6788 SDslu, 7397 SDs, 0 SdLazy, 26438 SolverSat, 1228 SolverUnsat, 153 SolverUnknown, 0 SolverNotchecked, 256.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2158 GetRequests, 975 SyntacticMatches, 40 SemanticMatches, 1143 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10857 ImplicationChecksByTransitivity, 432.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 41 MinimizatonAttempts, 464 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 74.1s InterpolantComputationTime, 2644 NumberOfCodeBlocks, 2644 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 2580 ConstructedInterpolants, 172 QuantifiedInterpolants, 1829057 SizeOfPredicates, 269 NumberOfNonLiveVariables, 5994 ConjunctsInSsa, 817 ConjunctsInUnsatCore, 64 InterpolantComputations, 20 PerfectInterpolantSequences, 442/765 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...