./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_99f9391e-9f06-4bf1-b266-3f2f8755c412/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27142e71f3089c5c3b5bf4f358882e993f701ffc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:37:07,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:37:07,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:37:07,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:37:07,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:37:07,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:37:07,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:37:07,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:37:07,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:37:07,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:37:07,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:37:07,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:37:07,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:37:07,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:37:07,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:37:07,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:37:07,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:37:07,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:37:07,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:37:07,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:37:07,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:37:07,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:37:07,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:37:07,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:37:07,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:37:07,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:37:07,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:37:07,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:37:07,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:37:07,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:37:07,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:37:07,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:37:07,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:37:07,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:37:07,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:37:07,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:37:07,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:37:07,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:37:07,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:37:07,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:37:07,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:37:07,194 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-12-07 18:37:07,203 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:37:07,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:37:07,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:37:07,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:37:07,204 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:37:07,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:37:07,204 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:37:07,204 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:37:07,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:37:07,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:37:07,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:37:07,205 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:37:07,205 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:37:07,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:37:07,205 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:37:07,205 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:37:07,205 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:37:07,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:37:07,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:37:07,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:37:07,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:37:07,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:37:07,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:37:07,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:37:07,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:37:07,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:37:07,207 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:37:07,207 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_99f9391e-9f06-4bf1-b266-3f2f8755c412/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-memcleanup) ) 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 -> 27142e71f3089c5c3b5bf4f358882e993f701ffc [2019-12-07 18:37:07,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:37:07,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:37:07,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:37:07,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:37:07,323 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:37:07,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-12-07 18:37:07,363 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/bin/uautomizer/data/428a9b6a2/e31bde1e7fe043958b87b0fd99cddc6c/FLAG6ec312173 [2019-12-07 18:37:07,851 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:37:07,851 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-12-07 18:37:07,859 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/bin/uautomizer/data/428a9b6a2/e31bde1e7fe043958b87b0fd99cddc6c/FLAG6ec312173 [2019-12-07 18:37:07,869 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/bin/uautomizer/data/428a9b6a2/e31bde1e7fe043958b87b0fd99cddc6c [2019-12-07 18:37:07,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:37:07,871 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:37:07,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:37:07,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:37:07,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:37:07,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:37:07" (1/1) ... [2019-12-07 18:37:07,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e011e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:37:07, skipping insertion in model container [2019-12-07 18:37:07,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:37:07" (1/1) ... [2019-12-07 18:37:07,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:37:07,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:37:08,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:37:08,115 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:37:08,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:37:08,180 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:37:08,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:37:08 WrapperNode [2019-12-07 18:37:08,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:37:08,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:37:08,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:37:08,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:37:08,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:37:08" (1/1) ... [2019-12-07 18:37:08,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:37:08" (1/1) ... [2019-12-07 18:37:08,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:37:08" (1/1) ... [2019-12-07 18:37:08,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:37:08" (1/1) ... [2019-12-07 18:37:08,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:37:08" (1/1) ... [2019-12-07 18:37:08,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:37:08" (1/1) ... [2019-12-07 18:37:08,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:37:08" (1/1) ... [2019-12-07 18:37:08,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:37:08,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:37:08,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:37:08,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:37:08,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:37:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:37:08,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:37:08,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:37:08,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 18:37:08,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 18:37:08,262 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-12-07 18:37:08,262 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-12-07 18:37:08,262 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2019-12-07 18:37:08,262 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-12-07 18:37:08,262 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2019-12-07 18:37:08,263 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2019-12-07 18:37:08,263 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:37:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 18:37:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 18:37:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 18:37:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 18:37:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 18:37:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 18:37:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 18:37:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 18:37:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 18:37:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 18:37:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 18:37:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 18:37:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 18:37:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 18:37:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 18:37:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 18:37:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 18:37:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 18:37:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 18:37:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 18:37:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 18:37:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 18:37:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 18:37:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 18:37:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 18:37:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 18:37:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 18:37:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 18:37:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 18:37:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 18:37:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 18:37:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 18:37:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 18:37:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 18:37:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 18:37:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 18:37:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 18:37:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 18:37:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 18:37:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 18:37:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 18:37:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 18:37:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-12-07 18:37:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:37:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:37:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2019-12-07 18:37:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:37:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-12-07 18:37:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:37:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2019-12-07 18:37:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2019-12-07 18:37:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:37:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:37:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 18:37:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:37:08,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:37:08,435 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-12-07 18:37:08,585 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:37:08,586 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 18:37:08,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:37:08 BoogieIcfgContainer [2019-12-07 18:37:08,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:37:08,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:37:08,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:37:08,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:37:08,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:37:07" (1/3) ... [2019-12-07 18:37:08,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a791b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:37:08, skipping insertion in model container [2019-12-07 18:37:08,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:37:08" (2/3) ... [2019-12-07 18:37:08,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a791b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:37:08, skipping insertion in model container [2019-12-07 18:37:08,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:37:08" (3/3) ... [2019-12-07 18:37:08,594 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2019-12-07 18:37:08,601 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:37:08,607 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2019-12-07 18:37:08,615 INFO L249 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2019-12-07 18:37:08,629 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:37:08,629 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:37:08,629 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:37:08,629 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:37:08,629 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:37:08,629 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:37:08,629 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:37:08,629 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:37:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-12-07 18:37:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:37:08,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:08,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:37:08,651 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1543228363, now seen corresponding path program 1 times [2019-12-07 18:37:08,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:08,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525464636] [2019-12-07 18:37:08,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:08,779 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 18:37:08,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525464636] [2019-12-07 18:37:08,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:37:08,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:37:08,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885125686] [2019-12-07 18:37:08,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:37:08,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:08,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:37:08,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:37:08,795 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 3 states. [2019-12-07 18:37:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:08,936 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2019-12-07 18:37:08,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:37:08,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:37:08,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:08,944 INFO L225 Difference]: With dead ends: 124 [2019-12-07 18:37:08,944 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 18:37:08,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:37:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 18:37:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2019-12-07 18:37:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 18:37:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2019-12-07 18:37:08,978 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 18 [2019-12-07 18:37:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:08,978 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2019-12-07 18:37:08,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:37:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2019-12-07 18:37:08,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:37:08,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:08,979 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] [2019-12-07 18:37:08,979 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:08,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:08,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1355798940, now seen corresponding path program 1 times [2019-12-07 18:37:08,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:08,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587549530] [2019-12-07 18:37:08,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,040 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 18:37:09,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587549530] [2019-12-07 18:37:09,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:37:09,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:37:09,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526276252] [2019-12-07 18:37:09,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:37:09,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:09,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:37:09,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:37:09,042 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 4 states. [2019-12-07 18:37:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:09,192 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2019-12-07 18:37:09,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:37:09,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 18:37:09,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:09,194 INFO L225 Difference]: With dead ends: 116 [2019-12-07 18:37:09,194 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 18:37:09,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 18:37:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 18:37:09,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2019-12-07 18:37:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 18:37:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2019-12-07 18:37:09,203 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 20 [2019-12-07 18:37:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:09,204 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2019-12-07 18:37:09,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:37:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2019-12-07 18:37:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:37:09,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:09,205 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] [2019-12-07 18:37:09,205 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:09,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:09,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1355798939, now seen corresponding path program 1 times [2019-12-07 18:37:09,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:09,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460589210] [2019-12-07 18:37:09,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,270 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 18:37:09,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460589210] [2019-12-07 18:37:09,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:37:09,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:37:09,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413345690] [2019-12-07 18:37:09,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:37:09,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:09,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:37:09,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:37:09,272 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 4 states. [2019-12-07 18:37:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:09,409 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2019-12-07 18:37:09,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:37:09,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 18:37:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:09,411 INFO L225 Difference]: With dead ends: 115 [2019-12-07 18:37:09,411 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 18:37:09,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 18:37:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 18:37:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2019-12-07 18:37:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 18:37:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2019-12-07 18:37:09,420 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 20 [2019-12-07 18:37:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:09,420 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2019-12-07 18:37:09,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:37:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2019-12-07 18:37:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:37:09,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:09,421 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] [2019-12-07 18:37:09,421 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:09,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1153442504, now seen corresponding path program 1 times [2019-12-07 18:37:09,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:09,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321286314] [2019-12-07 18:37:09,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:37:09,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321286314] [2019-12-07 18:37:09,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:37:09,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:37:09,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138621119] [2019-12-07 18:37:09,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:37:09,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:09,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:37:09,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:37:09,505 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 6 states. [2019-12-07 18:37:09,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:09,711 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2019-12-07 18:37:09,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:37:09,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-07 18:37:09,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:09,712 INFO L225 Difference]: With dead ends: 126 [2019-12-07 18:37:09,712 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 18:37:09,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:37:09,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 18:37:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2019-12-07 18:37:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 18:37:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2019-12-07 18:37:09,720 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 35 [2019-12-07 18:37:09,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:09,720 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2019-12-07 18:37:09,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:37:09,720 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2019-12-07 18:37:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:37:09,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:09,721 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] [2019-12-07 18:37:09,721 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:09,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:09,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1153442505, now seen corresponding path program 1 times [2019-12-07 18:37:09,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:09,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395188083] [2019-12-07 18:37:09,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:37:09,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395188083] [2019-12-07 18:37:09,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817015839] [2019-12-07 18:37:09,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:37:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:09,903 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:37:09,907 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:37:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:37:09,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:37:09,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 15 [2019-12-07 18:37:09,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791929505] [2019-12-07 18:37:09,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:37:09,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:09,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:37:09,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:37:09,971 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 9 states. [2019-12-07 18:37:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:10,030 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2019-12-07 18:37:10,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:37:10,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-07 18:37:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:10,031 INFO L225 Difference]: With dead ends: 101 [2019-12-07 18:37:10,031 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 18:37:10,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:37:10,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 18:37:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-12-07 18:37:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 18:37:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2019-12-07 18:37:10,036 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 35 [2019-12-07 18:37:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:10,036 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2019-12-07 18:37:10,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:37:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2019-12-07 18:37:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:37:10,037 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:10,037 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] [2019-12-07 18:37:10,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:37:10,239 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:10,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1486418432, now seen corresponding path program 1 times [2019-12-07 18:37:10,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:10,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057558018] [2019-12-07 18:37:10,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:37:10,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057558018] [2019-12-07 18:37:10,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56028178] [2019-12-07 18:37:10,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:37:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:10,634 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 18:37:10,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:37:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:37:10,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:37:10,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 21 [2019-12-07 18:37:10,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267185382] [2019-12-07 18:37:10,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 18:37:10,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:10,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:37:10,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:37:10,695 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 21 states. [2019-12-07 18:37:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:11,692 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2019-12-07 18:37:11,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:37:11,692 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-12-07 18:37:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:11,694 INFO L225 Difference]: With dead ends: 141 [2019-12-07 18:37:11,694 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 18:37:11,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=1113, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 18:37:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 18:37:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 110. [2019-12-07 18:37:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 18:37:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2019-12-07 18:37:11,703 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 40 [2019-12-07 18:37:11,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:11,704 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2019-12-07 18:37:11,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 18:37:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2019-12-07 18:37:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:37:11,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:11,705 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 18:37:11,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:37:11,909 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:11,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:11,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2038897208, now seen corresponding path program 2 times [2019-12-07 18:37:11,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:11,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495173560] [2019-12-07 18:37:11,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:37:12,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495173560] [2019-12-07 18:37:12,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:37:12,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:37:12,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267565042] [2019-12-07 18:37:12,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:37:12,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:12,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:37:12,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:37:12,008 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand 9 states. [2019-12-07 18:37:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:12,300 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2019-12-07 18:37:12,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:37:12,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-12-07 18:37:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:12,301 INFO L225 Difference]: With dead ends: 157 [2019-12-07 18:37:12,302 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 18:37:12,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:37:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 18:37:12,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 120. [2019-12-07 18:37:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 18:37:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2019-12-07 18:37:12,308 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 45 [2019-12-07 18:37:12,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:12,308 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2019-12-07 18:37:12,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:37:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2019-12-07 18:37:12,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:37:12,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:12,309 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 18:37:12,309 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:12,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:12,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2038895286, now seen corresponding path program 1 times [2019-12-07 18:37:12,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:12,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132142785] [2019-12-07 18:37:12,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:37:12,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132142785] [2019-12-07 18:37:12,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662300243] [2019-12-07 18:37:12,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:37:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:12,619 INFO L264 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:37:12,622 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:37:12,648 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 18:37:12,649 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:12,651 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:12,651 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:37:12,651 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:37:12,704 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:37:12,734 INFO L343 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2019-12-07 18:37:12,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 42 [2019-12-07 18:37:12,735 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:12,750 INFO L614 ElimStorePlain]: treesize reduction 17, result has 54.1 percent of original size [2019-12-07 18:37:12,751 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 18:37:12,751 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-12-07 18:37:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:37:12,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:37:12,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-12-07 18:37:12,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502163106] [2019-12-07 18:37:12,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:37:12,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:12,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:37:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:37:12,824 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 15 states. [2019-12-07 18:37:13,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:13,389 INFO L93 Difference]: Finished difference Result 171 states and 199 transitions. [2019-12-07 18:37:13,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:37:13,390 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-12-07 18:37:13,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:13,391 INFO L225 Difference]: With dead ends: 171 [2019-12-07 18:37:13,391 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 18:37:13,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:37:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 18:37:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 150. [2019-12-07 18:37:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-12-07 18:37:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 176 transitions. [2019-12-07 18:37:13,399 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 176 transitions. Word has length 45 [2019-12-07 18:37:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:13,399 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 176 transitions. [2019-12-07 18:37:13,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:37:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 176 transitions. [2019-12-07 18:37:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:37:13,401 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:13,401 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 18:37:13,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:37:13,602 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:13,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:13,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2038895285, now seen corresponding path program 1 times [2019-12-07 18:37:13,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:13,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716793498] [2019-12-07 18:37:13,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:37:13,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716793498] [2019-12-07 18:37:13,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920613869] [2019-12-07 18:37:13,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:37:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:13,819 INFO L264 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 18:37:13,821 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:37:13,826 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 18:37:13,826 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:13,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:13,834 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 18:37:13,834 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:13,838 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:13,839 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:37:13,839 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 18:37:13,872 INFO L430 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_8|], 2=[|v_old(#length)_AFTER_CALL_4|]} [2019-12-07 18:37:13,879 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:13,879 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 18:37:13,879 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:13,886 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:13,909 INFO L343 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2019-12-07 18:37:13,910 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 33 [2019-12-07 18:37:13,910 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:13,923 INFO L614 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2019-12-07 18:37:13,924 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:37:13,924 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:23 [2019-12-07 18:37:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:37:13,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:37:13,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-12-07 18:37:13,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336347888] [2019-12-07 18:37:13,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:37:13,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:13,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:37:13,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:37:13,989 INFO L87 Difference]: Start difference. First operand 150 states and 176 transitions. Second operand 13 states. [2019-12-07 18:37:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:14,566 INFO L93 Difference]: Finished difference Result 255 states and 287 transitions. [2019-12-07 18:37:14,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:37:14,567 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-12-07 18:37:14,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:14,568 INFO L225 Difference]: With dead ends: 255 [2019-12-07 18:37:14,568 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 18:37:14,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:37:14,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 18:37:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 196. [2019-12-07 18:37:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-12-07 18:37:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 239 transitions. [2019-12-07 18:37:14,578 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 239 transitions. Word has length 45 [2019-12-07 18:37:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:14,578 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 239 transitions. [2019-12-07 18:37:14,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:37:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 239 transitions. [2019-12-07 18:37:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:37:14,579 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:14,579 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 18:37:14,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:37:14,781 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:14,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:14,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1700792106, now seen corresponding path program 1 times [2019-12-07 18:37:14,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:14,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093239757] [2019-12-07 18:37:14,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 18:37:14,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093239757] [2019-12-07 18:37:14,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:37:14,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:37:14,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155412806] [2019-12-07 18:37:14,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:37:14,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:14,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:37:14,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:37:14,912 INFO L87 Difference]: Start difference. First operand 196 states and 239 transitions. Second operand 12 states. [2019-12-07 18:37:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:15,352 INFO L93 Difference]: Finished difference Result 267 states and 333 transitions. [2019-12-07 18:37:15,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:37:15,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-12-07 18:37:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:15,354 INFO L225 Difference]: With dead ends: 267 [2019-12-07 18:37:15,355 INFO L226 Difference]: Without dead ends: 267 [2019-12-07 18:37:15,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:37:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-12-07 18:37:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 226. [2019-12-07 18:37:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-12-07 18:37:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2019-12-07 18:37:15,364 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 49 [2019-12-07 18:37:15,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:15,365 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2019-12-07 18:37:15,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:37:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2019-12-07 18:37:15,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:37:15,366 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:15,366 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 18:37:15,366 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:15,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1700792105, now seen corresponding path program 1 times [2019-12-07 18:37:15,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:15,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249482673] [2019-12-07 18:37:15,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:15,493 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 18:37:15,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249482673] [2019-12-07 18:37:15,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:37:15,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:37:15,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163637453] [2019-12-07 18:37:15,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:37:15,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:15,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:37:15,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:37:15,495 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand 12 states. [2019-12-07 18:37:15,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:15,981 INFO L93 Difference]: Finished difference Result 268 states and 333 transitions. [2019-12-07 18:37:15,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:37:15,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-12-07 18:37:15,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:15,983 INFO L225 Difference]: With dead ends: 268 [2019-12-07 18:37:15,983 INFO L226 Difference]: Without dead ends: 268 [2019-12-07 18:37:15,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:37:15,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-07 18:37:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 226. [2019-12-07 18:37:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-12-07 18:37:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 283 transitions. [2019-12-07 18:37:15,991 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 283 transitions. Word has length 49 [2019-12-07 18:37:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:15,991 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 283 transitions. [2019-12-07 18:37:15,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:37:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 283 transitions. [2019-12-07 18:37:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:37:15,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:15,992 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2019-12-07 18:37:15,992 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:15,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:15,993 INFO L82 PathProgramCache]: Analyzing trace with hash 719459970, now seen corresponding path program 2 times [2019-12-07 18:37:15,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:15,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788874437] [2019-12-07 18:37:15,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:37:16,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788874437] [2019-12-07 18:37:16,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748132277] [2019-12-07 18:37:16,130 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:37:16,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:37:16,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:37:16,198 INFO L264 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:37:16,199 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:37:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:37:16,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:37:16,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 17 [2019-12-07 18:37:16,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867137618] [2019-12-07 18:37:16,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 18:37:16,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:16,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 18:37:16,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:37:16,238 INFO L87 Difference]: Start difference. First operand 226 states and 283 transitions. Second operand 17 states. [2019-12-07 18:37:16,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:16,747 INFO L93 Difference]: Finished difference Result 278 states and 352 transitions. [2019-12-07 18:37:16,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:37:16,748 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2019-12-07 18:37:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:16,750 INFO L225 Difference]: With dead ends: 278 [2019-12-07 18:37:16,750 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 18:37:16,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:37:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 18:37:16,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 234. [2019-12-07 18:37:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 18:37:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 294 transitions. [2019-12-07 18:37:16,758 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 294 transitions. Word has length 50 [2019-12-07 18:37:16,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:16,758 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 294 transitions. [2019-12-07 18:37:16,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 18:37:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2019-12-07 18:37:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:37:16,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:16,759 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 18:37:16,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:37:16,960 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:16,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:16,960 INFO L82 PathProgramCache]: Analyzing trace with hash -568425159, now seen corresponding path program 1 times [2019-12-07 18:37:16,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:16,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964720899] [2019-12-07 18:37:16,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:37:17,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964720899] [2019-12-07 18:37:17,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672242207] [2019-12-07 18:37:17,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:37:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:17,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 18:37:17,226 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:37:17,242 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:17,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:37:17,243 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:17,253 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 18:37:17,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:37:17,254 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-12-07 18:37:17,273 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 11 treesize of output 7 [2019-12-07 18:37:17,273 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:17,278 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:17,278 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 18:37:17,278 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-12-07 18:37:17,437 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 45 treesize of output 33 [2019-12-07 18:37:17,438 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:17,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:17,444 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 18:37:17,444 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:46 [2019-12-07 18:37:17,537 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:17,537 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 50 treesize of output 33 [2019-12-07 18:37:17,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:17,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:17,540 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 18:37:17,553 INFO L614 ElimStorePlain]: treesize reduction 3, result has 88.9 percent of original size [2019-12-07 18:37:17,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:17,554 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:37:17,554 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:15 [2019-12-07 18:37:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:37:17,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:37:17,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2019-12-07 18:37:17,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512848828] [2019-12-07 18:37:17,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 18:37:17,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:17,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 18:37:17,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:37:17,610 INFO L87 Difference]: Start difference. First operand 234 states and 294 transitions. Second operand 29 states. [2019-12-07 18:37:20,108 WARN L192 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 18:37:23,090 WARN L192 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-12-07 18:37:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:23,998 INFO L93 Difference]: Finished difference Result 363 states and 446 transitions. [2019-12-07 18:37:23,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:37:23,998 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-12-07 18:37:23,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:24,000 INFO L225 Difference]: With dead ends: 363 [2019-12-07 18:37:24,000 INFO L226 Difference]: Without dead ends: 363 [2019-12-07 18:37:24,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=263, Invalid=1899, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 18:37:24,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-07 18:37:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 256. [2019-12-07 18:37:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 18:37:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 324 transitions. [2019-12-07 18:37:24,011 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 324 transitions. Word has length 52 [2019-12-07 18:37:24,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:24,011 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 324 transitions. [2019-12-07 18:37:24,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 18:37:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 324 transitions. [2019-12-07 18:37:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:37:24,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:24,012 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 18:37:24,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:37:24,212 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:24,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:24,213 INFO L82 PathProgramCache]: Analyzing trace with hash -568425158, now seen corresponding path program 1 times [2019-12-07 18:37:24,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:24,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198115447] [2019-12-07 18:37:24,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:37:24,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198115447] [2019-12-07 18:37:24,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185231174] [2019-12-07 18:37:24,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:37:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:24,529 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-07 18:37:24,531 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:37:24,601 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:24,601 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 18:37:24,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:24,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:24,617 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 14 treesize of output 16 [2019-12-07 18:37:24,618 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:24,624 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:24,624 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:37:24,624 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 18:37:24,654 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 11 treesize of output 7 [2019-12-07 18:37:24,654 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:24,663 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:24,665 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 11 treesize of output 7 [2019-12-07 18:37:24,666 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:24,674 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:24,674 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 18:37:24,674 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:43 [2019-12-07 18:37:25,202 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:25,202 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 121 treesize of output 80 [2019-12-07 18:37:25,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:25,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:25,204 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 18:37:25,225 INFO L614 ElimStorePlain]: treesize reduction 3, result has 95.9 percent of original size [2019-12-07 18:37:25,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:25,230 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 1 case distinctions, treesize of input 62 treesize of output 41 [2019-12-07 18:37:25,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:25,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:25,231 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:25,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:25,237 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:37:25,237 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:23 [2019-12-07 18:37:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:37:25,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:37:25,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2019-12-07 18:37:25,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083387726] [2019-12-07 18:37:25,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 18:37:25,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:25,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 18:37:25,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=982, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 18:37:25,327 INFO L87 Difference]: Start difference. First operand 256 states and 324 transitions. Second operand 33 states. [2019-12-07 18:37:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:28,644 INFO L93 Difference]: Finished difference Result 359 states and 434 transitions. [2019-12-07 18:37:28,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:37:28,644 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 52 [2019-12-07 18:37:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:28,646 INFO L225 Difference]: With dead ends: 359 [2019-12-07 18:37:28,646 INFO L226 Difference]: Without dead ends: 359 [2019-12-07 18:37:28,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=328, Invalid=2534, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 18:37:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-12-07 18:37:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 256. [2019-12-07 18:37:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 18:37:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 322 transitions. [2019-12-07 18:37:28,653 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 322 transitions. Word has length 52 [2019-12-07 18:37:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:28,654 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 322 transitions. [2019-12-07 18:37:28,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 18:37:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 322 transitions. [2019-12-07 18:37:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 18:37:28,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:28,654 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 18:37:28,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:37:28,855 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1934497036, now seen corresponding path program 1 times [2019-12-07 18:37:28,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:28,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209335420] [2019-12-07 18:37:28,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 18:37:28,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209335420] [2019-12-07 18:37:28,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:37:28,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 18:37:28,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607914899] [2019-12-07 18:37:28,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:37:28,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:28,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:37:28,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:37:28,951 INFO L87 Difference]: Start difference. First operand 256 states and 322 transitions. Second operand 12 states. [2019-12-07 18:37:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:29,333 INFO L93 Difference]: Finished difference Result 306 states and 378 transitions. [2019-12-07 18:37:29,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:37:29,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-07 18:37:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:29,334 INFO L225 Difference]: With dead ends: 306 [2019-12-07 18:37:29,334 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 18:37:29,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:37:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 18:37:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 256. [2019-12-07 18:37:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 18:37:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 320 transitions. [2019-12-07 18:37:29,341 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 320 transitions. Word has length 54 [2019-12-07 18:37:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:29,341 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 320 transitions. [2019-12-07 18:37:29,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:37:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 320 transitions. [2019-12-07 18:37:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:37:29,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:29,342 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 18:37:29,342 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:29,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:29,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1138966854, now seen corresponding path program 1 times [2019-12-07 18:37:29,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:29,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508595445] [2019-12-07 18:37:29,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 18:37:29,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508595445] [2019-12-07 18:37:29,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390989581] [2019-12-07 18:37:29,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:37:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:29,709 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 18:37:29,711 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:37:29,715 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 18:37:29,715 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:29,719 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:29,719 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:37:29,719 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:37:29,724 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 18:37:29,724 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:29,728 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:29,728 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 18:37:29,728 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-12-07 18:37:29,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:37:29,839 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:37:29,883 INFO L343 Elim1Store]: treesize reduction 57, result has 41.8 percent of original size [2019-12-07 18:37:29,884 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 47 [2019-12-07 18:37:29,884 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:29,906 INFO L614 ElimStorePlain]: treesize reduction 17, result has 63.8 percent of original size [2019-12-07 18:37:29,907 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 18:37:29,907 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:30 [2019-12-07 18:37:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:37:29,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:37:29,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-12-07 18:37:29,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261881376] [2019-12-07 18:37:29,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 18:37:29,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:29,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 18:37:29,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:37:29,983 INFO L87 Difference]: Start difference. First operand 256 states and 320 transitions. Second operand 19 states. [2019-12-07 18:37:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:31,487 INFO L93 Difference]: Finished difference Result 406 states and 499 transitions. [2019-12-07 18:37:31,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:37:31,488 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2019-12-07 18:37:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:31,490 INFO L225 Difference]: With dead ends: 406 [2019-12-07 18:37:31,490 INFO L226 Difference]: Without dead ends: 406 [2019-12-07 18:37:31,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:37:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-07 18:37:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 327. [2019-12-07 18:37:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-07 18:37:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 420 transitions. [2019-12-07 18:37:31,503 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 420 transitions. Word has length 53 [2019-12-07 18:37:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:31,503 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 420 transitions. [2019-12-07 18:37:31,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 18:37:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 420 transitions. [2019-12-07 18:37:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:37:31,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:31,504 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 18:37:31,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:37:31,705 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:31,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:31,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1138966855, now seen corresponding path program 1 times [2019-12-07 18:37:31,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:31,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023864092] [2019-12-07 18:37:31,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 18:37:31,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023864092] [2019-12-07 18:37:31,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726144133] [2019-12-07 18:37:31,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:37:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:31,983 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 18:37:31,984 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:37:31,987 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 18:37:31,988 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:31,991 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:31,991 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:37:31,991 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 18:37:32,007 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 18:37:32,007 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:32,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:32,010 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 18:37:32,010 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-12-07 18:37:32,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:37:32,100 INFO L343 Elim1Store]: treesize reduction 57, result has 36.7 percent of original size [2019-12-07 18:37:32,100 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 3 case distinctions, treesize of input 18 treesize of output 41 [2019-12-07 18:37:32,101 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:32,118 INFO L614 ElimStorePlain]: treesize reduction 17, result has 63.0 percent of original size [2019-12-07 18:37:32,118 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 18:37:32,118 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:29 [2019-12-07 18:37:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:37:32,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:37:32,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-12-07 18:37:32,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085332355] [2019-12-07 18:37:32,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:37:32,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:32,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:37:32,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:37:32,186 INFO L87 Difference]: Start difference. First operand 327 states and 420 transitions. Second operand 16 states. [2019-12-07 18:37:33,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:33,167 INFO L93 Difference]: Finished difference Result 410 states and 498 transitions. [2019-12-07 18:37:33,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:37:33,168 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-12-07 18:37:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:33,171 INFO L225 Difference]: With dead ends: 410 [2019-12-07 18:37:33,171 INFO L226 Difference]: Without dead ends: 410 [2019-12-07 18:37:33,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-12-07 18:37:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-12-07 18:37:33,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 264. [2019-12-07 18:37:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-12-07 18:37:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 329 transitions. [2019-12-07 18:37:33,184 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 329 transitions. Word has length 53 [2019-12-07 18:37:33,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:33,185 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 329 transitions. [2019-12-07 18:37:33,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:37:33,185 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 329 transitions. [2019-12-07 18:37:33,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 18:37:33,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:33,186 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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 18:37:33,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:37:33,387 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:33,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:33,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1102150134, now seen corresponding path program 2 times [2019-12-07 18:37:33,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:33,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78440007] [2019-12-07 18:37:33,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:37:33,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78440007] [2019-12-07 18:37:33,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411407307] [2019-12-07 18:37:33,685 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:37:33,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:37:33,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:37:33,750 INFO L264 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 60 conjunts are in the unsatisfiable core [2019-12-07 18:37:33,751 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:37:33,755 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 11 treesize of output 7 [2019-12-07 18:37:33,755 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:33,760 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:33,761 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 11 treesize of output 7 [2019-12-07 18:37:33,762 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:33,765 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:33,765 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:37:33,766 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2019-12-07 18:37:33,773 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:33,773 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 18:37:33,774 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:33,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:33,779 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:37:33,779 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2019-12-07 18:37:33,808 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 19 treesize of output 18 [2019-12-07 18:37:33,808 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:33,817 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:33,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, 1 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 18:37:33,820 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:33,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:33,828 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 18:37:33,828 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:45 [2019-12-07 18:37:34,540 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:37:34,578 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:34,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 109 treesize of output 167 [2019-12-07 18:37:34,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:34,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:34,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,502 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 18:37:35,554 INFO L614 ElimStorePlain]: treesize reduction 111, result has 40.3 percent of original size [2019-12-07 18:37:35,582 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:35,582 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 95 [2019-12-07 18:37:35,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:37:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:35,632 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2019-12-07 18:37:35,882 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 24 [2019-12-07 18:37:35,882 INFO L614 ElimStorePlain]: treesize reduction 4546, result has 0.7 percent of original size [2019-12-07 18:37:35,884 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:37:35,884 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:132, output treesize:7 [2019-12-07 18:37:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:37:35,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:37:35,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 32 [2019-12-07 18:37:35,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988078453] [2019-12-07 18:37:35,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 18:37:35,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:35,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 18:37:35,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=921, Unknown=0, NotChecked=0, Total=992 [2019-12-07 18:37:35,899 INFO L87 Difference]: Start difference. First operand 264 states and 329 transitions. Second operand 32 states. [2019-12-07 18:37:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:37:40,365 INFO L93 Difference]: Finished difference Result 378 states and 458 transitions. [2019-12-07 18:37:40,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:37:40,365 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2019-12-07 18:37:40,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:37:40,367 INFO L225 Difference]: With dead ends: 378 [2019-12-07 18:37:40,367 INFO L226 Difference]: Without dead ends: 378 [2019-12-07 18:37:40,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=243, Invalid=2513, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 18:37:40,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-12-07 18:37:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 308. [2019-12-07 18:37:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-07 18:37:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 384 transitions. [2019-12-07 18:37:40,376 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 384 transitions. Word has length 55 [2019-12-07 18:37:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:37:40,376 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 384 transitions. [2019-12-07 18:37:40,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 18:37:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 384 transitions. [2019-12-07 18:37:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 18:37:40,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:37:40,378 INFO L410 BasicCegarLoop]: trace histogram [3, 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 18:37:40,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:37:40,579 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:37:40,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:37:40,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1039584905, now seen corresponding path program 1 times [2019-12-07 18:37:40,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:37:40,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016984515] [2019-12-07 18:37:40,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:37:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:37:40,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016984515] [2019-12-07 18:37:40,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137927910] [2019-12-07 18:37:40,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:37:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:37:40,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 18:37:40,827 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:37:40,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:37:40,860 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 11 treesize of output 7 [2019-12-07 18:37:40,860 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:40,863 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:40,863 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 18:37:40,863 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-12-07 18:37:41,412 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 24 treesize of output 16 [2019-12-07 18:37:41,412 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:37:41,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:37:41,418 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 18:37:41,418 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2019-12-07 18:37:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:37:43,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:37:43,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 26 [2019-12-07 18:37:43,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208535078] [2019-12-07 18:37:43,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 18:37:43,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:37:43,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 18:37:43,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=585, Unknown=1, NotChecked=0, Total=650 [2019-12-07 18:37:43,684 INFO L87 Difference]: Start difference. First operand 308 states and 384 transitions. Second operand 26 states. [2019-12-07 18:38:05,075 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 18:38:05,259 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-12-07 18:38:06,386 WARN L192 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-12-07 18:38:07,269 WARN L192 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-12-07 18:38:08,138 WARN L192 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-12-07 18:38:09,137 WARN L192 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-12-07 18:38:34,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:38:34,256 INFO L93 Difference]: Finished difference Result 434 states and 524 transitions. [2019-12-07 18:38:34,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 18:38:34,257 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2019-12-07 18:38:34,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:38:34,258 INFO L225 Difference]: With dead ends: 434 [2019-12-07 18:38:34,258 INFO L226 Difference]: Without dead ends: 425 [2019-12-07 18:38:34,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=279, Invalid=1882, Unknown=1, NotChecked=0, Total=2162 [2019-12-07 18:38:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-12-07 18:38:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 308. [2019-12-07 18:38:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-07 18:38:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 381 transitions. [2019-12-07 18:38:34,267 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 381 transitions. Word has length 57 [2019-12-07 18:38:34,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:38:34,267 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 381 transitions. [2019-12-07 18:38:34,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 18:38:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 381 transitions. [2019-12-07 18:38:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:38:34,268 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:38:34,268 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 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] [2019-12-07 18:38:34,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:38:34,469 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:38:34,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:38:34,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1879515130, now seen corresponding path program 2 times [2019-12-07 18:38:34,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:38:34,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237497463] [2019-12-07 18:38:34,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:38:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:38:34,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237497463] [2019-12-07 18:38:34,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434829378] [2019-12-07 18:38:34,623 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:38:34,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:38:34,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:38:34,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 18:38:34,698 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:38:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:38:34,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:38:34,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 20 [2019-12-07 18:38:34,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271533147] [2019-12-07 18:38:34,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 18:38:34,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:38:34,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 18:38:34,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:38:34,747 INFO L87 Difference]: Start difference. First operand 308 states and 381 transitions. Second operand 20 states. [2019-12-07 18:38:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:38:35,427 INFO L93 Difference]: Finished difference Result 416 states and 539 transitions. [2019-12-07 18:38:35,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:38:35,427 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2019-12-07 18:38:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:38:35,429 INFO L225 Difference]: With dead ends: 416 [2019-12-07 18:38:35,429 INFO L226 Difference]: Without dead ends: 416 [2019-12-07 18:38:35,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 18:38:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-12-07 18:38:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 316. [2019-12-07 18:38:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-12-07 18:38:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 393 transitions. [2019-12-07 18:38:35,437 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 393 transitions. Word has length 58 [2019-12-07 18:38:35,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:38:35,437 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 393 transitions. [2019-12-07 18:38:35,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 18:38:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 393 transitions. [2019-12-07 18:38:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 18:38:35,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:38:35,438 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 18:38:35,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:38:35,638 INFO L410 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:38:35,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:38:35,639 INFO L82 PathProgramCache]: Analyzing trace with hash -425703444, now seen corresponding path program 2 times [2019-12-07 18:38:35,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:38:35,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531511418] [2019-12-07 18:38:35,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:38:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:38:35,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531511418] [2019-12-07 18:38:35,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639546926] [2019-12-07 18:38:35,857 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:38:35,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:38:35,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:38:35,932 INFO L264 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 18:38:35,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:38:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 18:38:35,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:38:35,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 20 [2019-12-07 18:38:35,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982326300] [2019-12-07 18:38:35,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 18:38:35,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:38:35,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 18:38:35,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:38:35,996 INFO L87 Difference]: Start difference. First operand 316 states and 393 transitions. Second operand 20 states. [2019-12-07 18:38:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:38:36,667 INFO L93 Difference]: Finished difference Result 429 states and 543 transitions. [2019-12-07 18:38:36,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:38:36,667 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2019-12-07 18:38:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:38:36,669 INFO L225 Difference]: With dead ends: 429 [2019-12-07 18:38:36,669 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 18:38:36,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2019-12-07 18:38:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 18:38:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 326. [2019-12-07 18:38:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-12-07 18:38:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 406 transitions. [2019-12-07 18:38:36,676 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 406 transitions. Word has length 60 [2019-12-07 18:38:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:38:36,677 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 406 transitions. [2019-12-07 18:38:36,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 18:38:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 406 transitions. [2019-12-07 18:38:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 18:38:36,678 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:38:36,678 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2019-12-07 18:38:36,878 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:38:36,878 INFO L410 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:38:36,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:38:36,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1054213292, now seen corresponding path program 1 times [2019-12-07 18:38:36,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:38:36,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001762554] [2019-12-07 18:38:36,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:38:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 18:38:37,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001762554] [2019-12-07 18:38:37,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497474001] [2019-12-07 18:38:37,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:38:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:37,211 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:38:37,212 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:38:37,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:38:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:38:37,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:38:37,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 25 [2019-12-07 18:38:37,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580216853] [2019-12-07 18:38:37,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 18:38:37,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:38:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 18:38:37,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:38:37,317 INFO L87 Difference]: Start difference. First operand 326 states and 406 transitions. Second operand 25 states. [2019-12-07 18:38:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:38:38,705 INFO L93 Difference]: Finished difference Result 428 states and 548 transitions. [2019-12-07 18:38:38,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:38:38,706 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2019-12-07 18:38:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:38:38,707 INFO L225 Difference]: With dead ends: 428 [2019-12-07 18:38:38,707 INFO L226 Difference]: Without dead ends: 428 [2019-12-07 18:38:38,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 18:38:38,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-12-07 18:38:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 344. [2019-12-07 18:38:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-07 18:38:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 431 transitions. [2019-12-07 18:38:38,717 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 431 transitions. Word has length 61 [2019-12-07 18:38:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:38:38,718 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 431 transitions. [2019-12-07 18:38:38,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 18:38:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 431 transitions. [2019-12-07 18:38:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 18:38:38,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:38:38,719 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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 18:38:38,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:38:38,920 INFO L410 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:38:38,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:38:38,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1435315670, now seen corresponding path program 1 times [2019-12-07 18:38:38,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:38:38,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57512] [2019-12-07 18:38:38,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:38:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 18:38:39,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57512] [2019-12-07 18:38:39,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826178843] [2019-12-07 18:38:39,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:38:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:39,204 INFO L264 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 18:38:39,205 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:38:39,208 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 18:38:39,208 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:38:39,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:38:39,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:38:39,209 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 18:38:39,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:38:39,301 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 18:38:39,301 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 2 case distinctions, treesize of input 15 treesize of output 31 [2019-12-07 18:38:39,302 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:38:39,312 INFO L614 ElimStorePlain]: treesize reduction 17, result has 48.5 percent of original size [2019-12-07 18:38:39,313 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 18:38:39,313 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:16 [2019-12-07 18:38:39,359 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:38:39,360 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 18:38:39,360 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:38:39,368 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 18:38:39,368 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 18:38:39,369 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-12-07 18:38:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 18:38:39,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:38:39,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2019-12-07 18:38:39,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410410606] [2019-12-07 18:38:39,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 18:38:39,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:38:39,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 18:38:39,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:38:39,379 INFO L87 Difference]: Start difference. First operand 344 states and 431 transitions. Second operand 19 states. [2019-12-07 18:38:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:38:40,202 INFO L93 Difference]: Finished difference Result 397 states and 492 transitions. [2019-12-07 18:38:40,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:38:40,202 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-12-07 18:38:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:38:40,203 INFO L225 Difference]: With dead ends: 397 [2019-12-07 18:38:40,204 INFO L226 Difference]: Without dead ends: 397 [2019-12-07 18:38:40,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:38:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-12-07 18:38:40,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 365. [2019-12-07 18:38:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-12-07 18:38:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 464 transitions. [2019-12-07 18:38:40,210 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 464 transitions. Word has length 61 [2019-12-07 18:38:40,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:38:40,210 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 464 transitions. [2019-12-07 18:38:40,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 18:38:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 464 transitions. [2019-12-07 18:38:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 18:38:40,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:38:40,211 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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 18:38:40,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:38:40,412 INFO L410 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:38:40,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:38:40,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1435315671, now seen corresponding path program 1 times [2019-12-07 18:38:40,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:38:40,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253255943] [2019-12-07 18:38:40,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:38:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 18:38:40,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253255943] [2019-12-07 18:38:40,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214434646] [2019-12-07 18:38:40,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:38:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:40,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 18:38:40,668 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:38:40,672 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 18:38:40,672 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:38:40,676 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:38:40,676 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:38:40,676 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 18:38:40,694 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 18:38:40,694 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:38:40,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:38:40,697 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 18:38:40,698 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-12-07 18:38:40,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:38:40,762 INFO L343 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2019-12-07 18:38:40,762 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 23 [2019-12-07 18:38:40,763 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:38:40,777 INFO L614 ElimStorePlain]: treesize reduction 4, result has 86.2 percent of original size [2019-12-07 18:38:40,777 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 18:38:40,778 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:25 [2019-12-07 18:38:40,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:38:40,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:38:40,917 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:38:40,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-12-07 18:38:40,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:38:40,935 INFO L614 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-12-07 18:38:40,936 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 18:38:40,936 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2019-12-07 18:38:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 18:38:40,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:38:40,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2019-12-07 18:38:40,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430993637] [2019-12-07 18:38:40,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 18:38:40,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:38:40,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 18:38:40,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:38:40,974 INFO L87 Difference]: Start difference. First operand 365 states and 464 transitions. Second operand 20 states. [2019-12-07 18:38:41,815 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-12-07 18:38:42,058 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-07 18:38:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:38:43,204 INFO L93 Difference]: Finished difference Result 440 states and 535 transitions. [2019-12-07 18:38:43,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:38:43,204 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2019-12-07 18:38:43,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:38:43,206 INFO L225 Difference]: With dead ends: 440 [2019-12-07 18:38:43,206 INFO L226 Difference]: Without dead ends: 440 [2019-12-07 18:38:43,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:38:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-12-07 18:38:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 372. [2019-12-07 18:38:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-12-07 18:38:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 470 transitions. [2019-12-07 18:38:43,213 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 470 transitions. Word has length 61 [2019-12-07 18:38:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:38:43,213 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 470 transitions. [2019-12-07 18:38:43,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 18:38:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 470 transitions. [2019-12-07 18:38:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 18:38:43,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:38:43,214 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 18:38:43,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:38:43,415 INFO L410 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:38:43,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:38:43,415 INFO L82 PathProgramCache]: Analyzing trace with hash -694876470, now seen corresponding path program 3 times [2019-12-07 18:38:43,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:38:43,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342408322] [2019-12-07 18:38:43,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:38:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:38:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 18:38:43,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342408322] [2019-12-07 18:38:43,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869803848] [2019-12-07 18:38:43,922 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:38:44,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 18:38:44,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:38:44,004 INFO L264 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 18:38:44,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:38:44,009 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 18:38:44,009 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:38:44,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:38:44,012 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:38:44,012 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:38:44,016 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 18:38:44,016 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:38:44,018 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:38:44,019 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 18:38:44,019 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-12-07 18:38:44,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:38:44,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:38:44,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:38:44,252 INFO L343 Elim1Store]: treesize reduction 106, result has 26.4 percent of original size [2019-12-07 18:38:44,252 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 4 case distinctions, treesize of input 21 treesize of output 41 [2019-12-07 18:38:44,253 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:38:44,273 INFO L614 ElimStorePlain]: treesize reduction 17, result has 67.9 percent of original size [2019-12-07 18:38:44,274 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 18:38:44,274 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:36 [2019-12-07 18:38:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 38 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 18:38:44,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:38:44,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-12-07 18:38:44,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816575786] [2019-12-07 18:38:44,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 18:38:44,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:38:44,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:38:44,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:38:44,369 INFO L87 Difference]: Start difference. First operand 372 states and 470 transitions. Second operand 21 states. [2019-12-07 18:38:44,971 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-12-07 18:38:52,136 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-12-07 18:40:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:32,951 INFO L93 Difference]: Finished difference Result 516 states and 640 transitions. [2019-12-07 18:40:32,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:40:32,952 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2019-12-07 18:40:32,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:32,954 INFO L225 Difference]: With dead ends: 516 [2019-12-07 18:40:32,954 INFO L226 Difference]: Without dead ends: 516 [2019-12-07 18:40:32,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=197, Invalid=672, Unknown=1, NotChecked=0, Total=870 [2019-12-07 18:40:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-12-07 18:40:32,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 447. [2019-12-07 18:40:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-12-07 18:40:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 574 transitions. [2019-12-07 18:40:32,965 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 574 transitions. Word has length 61 [2019-12-07 18:40:32,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:40:32,965 INFO L462 AbstractCegarLoop]: Abstraction has 447 states and 574 transitions. [2019-12-07 18:40:32,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 18:40:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 574 transitions. [2019-12-07 18:40:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 18:40:32,967 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:32,967 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 18:40:33,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:40:33,167 INFO L410 AbstractCegarLoop]: === Iteration 26 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:40:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:33,168 INFO L82 PathProgramCache]: Analyzing trace with hash -694876469, now seen corresponding path program 2 times [2019-12-07 18:40:33,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:33,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457093738] [2019-12-07 18:40:33,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 18:40:33,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457093738] [2019-12-07 18:40:33,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876594165] [2019-12-07 18:40:33,470 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/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 18:40:33,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:40:33,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:40:33,550 INFO L264 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 18:40:33,552 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:40:33,556 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 18:40:33,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:40:33,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:40:33,564 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 18:40:33,564 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:40:33,570 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:40:33,570 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:40:33,570 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-12-07 18:40:33,575 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 18:40:33,575 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:40:33,580 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:40:33,582 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 18:40:33,582 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:40:33,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:40:33,585 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:40:33,586 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-12-07 18:40:33,692 INFO L430 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_36|], 4=[|v_#length_BEFORE_CALL_9|]} [2019-12-07 18:40:33,699 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:40:33,699 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 18:40:33,699 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:40:33,707 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:40:33,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:40:33,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:40:33,750 INFO L343 Elim1Store]: treesize reduction 93, result has 27.3 percent of original size [2019-12-07 18:40:33,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 43 [2019-12-07 18:40:33,750 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:40:33,775 INFO L614 ElimStorePlain]: treesize reduction 14, result has 75.4 percent of original size [2019-12-07 18:40:33,775 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 18:40:33,775 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:43 [2019-12-07 18:40:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 38 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 18:40:33,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:40:33,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-12-07 18:40:33,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450787545] [2019-12-07 18:40:33,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 18:40:33,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:40:33,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 18:40:33,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:40:33,878 INFO L87 Difference]: Start difference. First operand 447 states and 574 transitions. Second operand 18 states. [2019-12-07 18:40:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:35,919 INFO L93 Difference]: Finished difference Result 560 states and 691 transitions. [2019-12-07 18:40:35,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 18:40:35,920 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-12-07 18:40:35,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:35,922 INFO L225 Difference]: With dead ends: 560 [2019-12-07 18:40:35,922 INFO L226 Difference]: Without dead ends: 560 [2019-12-07 18:40:35,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:40:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-12-07 18:40:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 380. [2019-12-07 18:40:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-12-07 18:40:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 479 transitions. [2019-12-07 18:40:35,928 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 479 transitions. Word has length 61 [2019-12-07 18:40:35,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:40:35,929 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 479 transitions. [2019-12-07 18:40:35,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 18:40:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 479 transitions. [2019-12-07 18:40:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 18:40:35,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:35,929 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 18:40:36,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:40:36,130 INFO L410 AbstractCegarLoop]: === Iteration 27 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:40:36,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:36,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1884878442, now seen corresponding path program 1 times [2019-12-07 18:40:36,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:36,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072254347] [2019-12-07 18:40:36,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 18:40:36,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072254347] [2019-12-07 18:40:36,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:40:36,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:40:36,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775114749] [2019-12-07 18:40:36,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:40:36,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:40:36,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:40:36,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:40:36,322 INFO L87 Difference]: Start difference. First operand 380 states and 479 transitions. Second operand 12 states. [2019-12-07 18:40:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:36,765 INFO L93 Difference]: Finished difference Result 422 states and 526 transitions. [2019-12-07 18:40:36,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:40:36,765 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-07 18:40:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:36,766 INFO L225 Difference]: With dead ends: 422 [2019-12-07 18:40:36,766 INFO L226 Difference]: Without dead ends: 422 [2019-12-07 18:40:36,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:40:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-07 18:40:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 394. [2019-12-07 18:40:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-12-07 18:40:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 500 transitions. [2019-12-07 18:40:36,772 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 500 transitions. Word has length 64 [2019-12-07 18:40:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:40:36,773 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 500 transitions. [2019-12-07 18:40:36,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:40:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 500 transitions. [2019-12-07 18:40:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 18:40:36,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:36,774 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 18:40:36,775 INFO L410 AbstractCegarLoop]: === Iteration 28 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:40:36,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:36,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1884878441, now seen corresponding path program 1 times [2019-12-07 18:40:36,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:36,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404413723] [2019-12-07 18:40:36,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 18:40:36,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404413723] [2019-12-07 18:40:36,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:40:36,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:40:36,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755262269] [2019-12-07 18:40:36,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:40:36,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:40:36,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:40:36,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:40:36,901 INFO L87 Difference]: Start difference. First operand 394 states and 500 transitions. Second operand 12 states. [2019-12-07 18:40:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:37,370 INFO L93 Difference]: Finished difference Result 432 states and 536 transitions. [2019-12-07 18:40:37,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:40:37,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-07 18:40:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:37,372 INFO L225 Difference]: With dead ends: 432 [2019-12-07 18:40:37,372 INFO L226 Difference]: Without dead ends: 432 [2019-12-07 18:40:37,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:40:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-07 18:40:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 399. [2019-12-07 18:40:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-12-07 18:40:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 507 transitions. [2019-12-07 18:40:37,378 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 507 transitions. Word has length 64 [2019-12-07 18:40:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:40:37,378 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 507 transitions. [2019-12-07 18:40:37,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:40:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 507 transitions. [2019-12-07 18:40:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:40:37,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:37,379 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 18:40:37,379 INFO L410 AbstractCegarLoop]: === Iteration 29 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_insertErr6REQUIRES_VIOLATION, sll_insertErr0REQUIRES_VIOLATION, sll_insertErr1REQUIRES_VIOLATION, sll_insertErr7REQUIRES_VIOLATION, sll_insertErr5REQUIRES_VIOLATION, sll_insertErr9REQUIRES_VIOLATION, sll_insertErr4REQUIRES_VIOLATION, sll_insertErr2REQUIRES_VIOLATION, sll_insertErr8REQUIRES_VIOLATION, sll_insertErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2019-12-07 18:40:37,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:37,379 INFO L82 PathProgramCache]: Analyzing trace with hash 456586228, now seen corresponding path program 1 times [2019-12-07 18:40:37,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:37,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511047723] [2019-12-07 18:40:37,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:40:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:40:37,410 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:40:37,410 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:40:37,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:40:37 BoogieIcfgContainer [2019-12-07 18:40:37,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:40:37,437 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:40:37,438 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:40:37,438 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:40:37,438 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:37:08" (3/4) ... [2019-12-07 18:40:37,439 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:40:37,478 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_99f9391e-9f06-4bf1-b266-3f2f8755c412/bin/uautomizer/witness.graphml [2019-12-07 18:40:37,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:40:37,479 INFO L168 Benchmark]: Toolchain (without parser) took 209608.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.1 MB). Free memory was 939.3 MB in the beginning and 938.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 294.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:40:37,480 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:40:37,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:40:37,480 INFO L168 Benchmark]: Boogie Preprocessor took 41.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:40:37,480 INFO L168 Benchmark]: RCFGBuilder took 364.77 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: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:40:37,481 INFO L168 Benchmark]: TraceAbstraction took 208849.34 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 196.1 MB). Free memory was 1.0 GB in the beginning and 941.3 MB in the end (delta: 67.4 MB). Peak memory consumption was 263.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:40:37,481 INFO L168 Benchmark]: Witness Printer took 41.16 ms. Allocated memory is still 1.3 GB. Free memory was 941.3 MB in the beginning and 938.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:40:37,482 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 308.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 364.77 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: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 208849.34 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 196.1 MB). Free memory was 1.0 GB in the beginning and 941.3 MB in the end (delta: 67.4 MB). Peak memory consumption was 263.5 MB. Max. memory is 11.5 GB. * Witness Printer took 41.16 ms. Allocated memory is still 1.3 GB. Free memory was 941.3 MB in the beginning and 938.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L616] CALL, EXPR _get_nondet_int(2, 5) VAL [\old(from)=2, \old(until)=5] [L609] int len = from; VAL [\old(from)=2, \old(until)=5, from=2, len=2, until=5] [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=2, \old(until)=5, __VERIFIER_nondet_int()=0, from=2, len=2, len < until && __VERIFIER_nondet_int()=0, until=5] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; VAL [\old(from)=2, \old(until)=5, \result=2, from=2, len=2, until=5] [L616] RET, EXPR _get_nondet_int(2, 5) VAL [_get_nondet_int(2, 5)=2] [L616] const int len = _get_nondet_int(2, 5); [L617] SLL s = sll_create(len); VAL [len=2, s={2:0}] [L617] CALL, EXPR sll_create(len) VAL [\old(len)=2] [L564] SLL head = ((void *)0); VAL [\old(len)=2, head={0:0}, len=2] [L565] EXPR len-- VAL [\old(len)=2, head={0:0}, len=1, len--=2] [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L570] new_head->next = head VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L571] head = new_head VAL [\old(len)=2, head={-1:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L565] EXPR len-- VAL [\old(len)=2, head={-1:0}, len=0, len--=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=2, head={-1:0}, len=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=2, head={-1:0}, len=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L570] new_head->next = head VAL [\old(len)=2, head={-1:0}, len=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L571] head = new_head VAL [\old(len)=2, head={-2:0}, len=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L565] EXPR len-- VAL [\old(len)=2, head={-2:0}, len=-1, len--=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L565] COND FALSE !(len-- > 0) [L573] return head; VAL [\old(len)=2, \result={-2:0}, head={-2:0}, len=-1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L617] RET, EXPR sll_create(len) VAL [len=2, s={2:0}, sll_create(len)={-2:0}] [L617] SLL s = sll_create(len); [L618] CALL, EXPR _get_nondet_int(0, len - 1) VAL [\old(from)=0, \old(until)=1] [L609] int len = from; VAL [\old(from)=0, \old(until)=1, from=0, len=0, until=1] [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, __VERIFIER_nondet_int()=1, from=0, len=0, len < until && __VERIFIER_nondet_int()=1, until=1] [L610] COND TRUE len < until && __VERIFIER_nondet_int() [L611] len++ VAL [\old(from)=0, \old(until)=1, from=0, len=1, until=1] [L610] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, from=0, len=1, len < until && __VERIFIER_nondet_int()=0, until=1] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; VAL [\old(from)=0, \old(until)=1, \result=1, from=0, len=1, until=1] [L618] RET, EXPR _get_nondet_int(0, len - 1) VAL [_get_nondet_int(0, len - 1)=1, len=2, s={2:0}] [L618] const int k = _get_nondet_int(0, len - 1); [L619] int i = 0; VAL [i=0, k=1, len=2, s={2:0}] [L620] i < k && __VERIFIER_nondet_int() [L620] i < k && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=0, i < k && __VERIFIER_nondet_int()=0, k=1, len=2, s={2:0}] [L620] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L625] EXPR \read(s) VAL [\read(s)={-2:0}, i=0, k=1, len=2, s={2:0}] [L625] CALL, EXPR sll_length(s) VAL [head={-2:0}] [L576] int len = 0; VAL [head={-2:0}, head={-2:0}, len=0] [L577] COND TRUE \read(head) [L578] len++ VAL [head={-2:0}, head={-2:0}, len=1] [L579] EXPR head->next VAL [head={-2:0}, head={-2:0}, head->next={-1:0}, len=1] [L579] head = head->next [L577] COND TRUE \read(head) [L578] len++ VAL [head={-1:0}, head={-2:0}, len=2] [L579] EXPR head->next VAL [head={-2:0}, head={-1:0}, head->next={0:0}, len=2] [L579] head = head->next [L577] COND FALSE !(\read(head)) VAL [head={-2:0}, head={0:0}, len=2] [L581] return len; VAL [\result=2, head={-2:0}, head={0:0}, len=2] [L625] RET, EXPR sll_length(s) VAL [\read(s)={-2:0}, i=0, k=1, len=2, s={2:0}, sll_length(s)=2] [L625] COND TRUE k + len != sll_length(s) [L630] __VERIFIER_error() VAL [i=0, k=1, len=2, s={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 113 locations, 25 error locations. Result: UNSAFE, OverallTime: 208.7s, OverallIterations: 29, TraceHistogramMax: 5, AutomataDifference: 189.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2459 SDtfs, 6279 SDslu, 13847 SDs, 0 SdLazy, 23871 SolverSat, 1542 SolverUnsat, 100 SolverUnknown, 0 SolverNotchecked, 165.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1761 GetRequests, 1068 SyntacticMatches, 24 SemanticMatches, 669 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3275 ImplicationChecksByTransitivity, 30.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 1707 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 2401 NumberOfCodeBlocks, 2401 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 2292 ConstructedInterpolants, 333 QuantifiedInterpolants, 2545073 SizeOfPredicates, 156 NumberOfNonLiveVariables, 4071 ConjunctsInSsa, 455 ConjunctsInUnsatCore, 46 InterpolantComputations, 11 PerfectInterpolantSequences, 636/1171 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 incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...