./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9cd680588366d8f4117005099c5fa975e5f03ed ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:52:15,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:52:15,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:52:15,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:52:15,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:52:15,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:52:15,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:52:15,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:52:15,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:52:15,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:52:15,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:52:15,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:52:15,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:52:15,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:52:15,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:52:15,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:52:15,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:52:15,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:52:15,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:52:15,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:52:15,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:52:15,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:52:15,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:52:15,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:52:15,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:52:15,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:52:15,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:52:15,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:52:15,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:52:15,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:52:15,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:52:15,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:52:15,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:52:15,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:52:15,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:52:15,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:52:15,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:52:15,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:52:15,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:52:15,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:52:15,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:52:15,715 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 23:52:15,738 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:52:15,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:52:15,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:52:15,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:52:15,740 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:52:15,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:52:15,740 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:52:15,741 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:52:15,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:52:15,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:52:15,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:52:15,741 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:52:15,742 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:52:15,742 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:52:15,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:52:15,742 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:52:15,742 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:52:15,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:52:15,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:52:15,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:52:15,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:52:15,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:52:15,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:52:15,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:52:15,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:52:15,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:52:15,744 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_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d9cd680588366d8f4117005099c5fa975e5f03ed [2019-11-15 23:52:15,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:52:15,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:52:15,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:52:15,799 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:52:15,807 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:52:15,808 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_remove_all.i [2019-11-15 23:52:15,874 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer/data/ba9a90009/ec092b410b4145858fa547322e1afc10/FLAGbfa3b95de [2019-11-15 23:52:16,315 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:52:16,316 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2019-11-15 23:52:16,333 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer/data/ba9a90009/ec092b410b4145858fa547322e1afc10/FLAGbfa3b95de [2019-11-15 23:52:16,690 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer/data/ba9a90009/ec092b410b4145858fa547322e1afc10 [2019-11-15 23:52:16,691 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:52:16,692 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:52:16,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:16,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:52:16,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:52:16,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:16" (1/1) ... [2019-11-15 23:52:16,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba2d5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:16, skipping insertion in model container [2019-11-15 23:52:16,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:16" (1/1) ... [2019-11-15 23:52:16,706 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:52:16,748 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:52:17,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:17,152 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:52:17,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:17,249 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:52:17,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:17 WrapperNode [2019-11-15 23:52:17,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:17,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:52:17,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:52:17,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:52:17,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:17" (1/1) ... [2019-11-15 23:52:17,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:17" (1/1) ... [2019-11-15 23:52:17,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:17" (1/1) ... [2019-11-15 23:52:17,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:17" (1/1) ... [2019-11-15 23:52:17,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:17" (1/1) ... [2019-11-15 23:52:17,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:17" (1/1) ... [2019-11-15 23:52:17,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:17" (1/1) ... [2019-11-15 23:52:17,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:52:17,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:52:17,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:52:17,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:52:17,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:17,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:52:17,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:52:17,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 23:52:17,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 23:52:17,367 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 23:52:17,367 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 23:52:17,368 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-11-15 23:52:17,368 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2019-11-15 23:52:17,369 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:52:17,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 23:52:17,369 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 23:52:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 23:52:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:52:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:52:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:52:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:52:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:52:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:52:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:52:17,372 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:52:17,372 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:52:17,372 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:52:17,372 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:52:17,373 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:52:17,373 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:52:17,373 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:52:17,373 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:52:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:52:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:52:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:52:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:52:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:52:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:52:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:52:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:52:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:52:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:52:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:52:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:52:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:52:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:52:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:52:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:52:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:52:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:52:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:52:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:52:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:52:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:52:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:52:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:52:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:52:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:52:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:52:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:52:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:52:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:52:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:52:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:52:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:52:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:52:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:52:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:52:17,379 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:52:17,379 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:52:17,379 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:52:17,379 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 23:52:17,379 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:52:17,379 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:52:17,379 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:52:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:52:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:52:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:52:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:52:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:52:17,381 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:52:17,381 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:52:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:52:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:52:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:52:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:52:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:52:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:52:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:52:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:52:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:52:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:52:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:52:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:52:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:52:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:52:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:52:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:52:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:52:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:52:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:52:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:52:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:52:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:52:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:52:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:52:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:52:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:52:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:52:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:52:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:52:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:52:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:52:17,385 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:52:17,386 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:52:17,386 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:52:17,386 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:52:17,386 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:52:17,386 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:52:17,386 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:52:17,386 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 23:52:17,387 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 23:52:17,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:52:17,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:52:17,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:52:17,387 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-11-15 23:52:17,387 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2019-11-15 23:52:17,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:52:17,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:52:17,388 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:52:17,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:52:17,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 23:52:17,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:52:17,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:52:17,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:52:17,665 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 23:52:17,926 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:52:17,926 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-15 23:52:17,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:17 BoogieIcfgContainer [2019-11-15 23:52:17,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:52:17,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:52:17,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:52:17,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:52:17,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:52:16" (1/3) ... [2019-11-15 23:52:17,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d9f349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:52:17, skipping insertion in model container [2019-11-15 23:52:17,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:17" (2/3) ... [2019-11-15 23:52:17,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d9f349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:52:17, skipping insertion in model container [2019-11-15 23:52:17,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:17" (3/3) ... [2019-11-15 23:52:17,935 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2019-11-15 23:52:17,943 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:52:17,950 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2019-11-15 23:52:17,960 INFO L249 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2019-11-15 23:52:17,976 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:52:17,977 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:52:17,977 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:52:17,977 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:52:17,977 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:52:17,977 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:52:17,978 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:52:17,978 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:52:17,992 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-11-15 23:52:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:52:18,001 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:18,002 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:18,004 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:18,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:18,009 INFO L82 PathProgramCache]: Analyzing trace with hash -514962171, now seen corresponding path program 1 times [2019-11-15 23:52:18,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:18,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042651225] [2019-11-15 23:52:18,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:18,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:18,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:18,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042651225] [2019-11-15 23:52:18,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:18,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:18,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262117605] [2019-11-15 23:52:18,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:18,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:18,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:18,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:18,209 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-11-15 23:52:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:18,441 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2019-11-15 23:52:18,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:18,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 23:52:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:18,453 INFO L225 Difference]: With dead ends: 71 [2019-11-15 23:52:18,453 INFO L226 Difference]: Without dead ends: 64 [2019-11-15 23:52:18,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-15 23:52:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-11-15 23:52:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 23:52:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-11-15 23:52:18,499 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 11 [2019-11-15 23:52:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:18,500 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-11-15 23:52:18,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-11-15 23:52:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:52:18,501 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:18,502 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:18,502 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:18,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:18,503 INFO L82 PathProgramCache]: Analyzing trace with hash -514962170, now seen corresponding path program 1 times [2019-11-15 23:52:18,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:18,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171900044] [2019-11-15 23:52:18,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:18,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:18,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:18,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171900044] [2019-11-15 23:52:18,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:18,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:18,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985642843] [2019-11-15 23:52:18,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:18,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:18,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:18,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:18,621 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 4 states. [2019-11-15 23:52:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:18,766 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-11-15 23:52:18,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:18,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 23:52:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:18,768 INFO L225 Difference]: With dead ends: 61 [2019-11-15 23:52:18,769 INFO L226 Difference]: Without dead ends: 61 [2019-11-15 23:52:18,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:18,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-15 23:52:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-11-15 23:52:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-15 23:52:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-15 23:52:18,777 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 11 [2019-11-15 23:52:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:18,778 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-15 23:52:18,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-15 23:52:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:52:18,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:18,779 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:18,779 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:18,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:18,780 INFO L82 PathProgramCache]: Analyzing trace with hash -943001015, now seen corresponding path program 1 times [2019-11-15 23:52:18,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:18,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868366468] [2019-11-15 23:52:18,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:18,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:18,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:18,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868366468] [2019-11-15 23:52:18,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:18,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:52:18,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938905466] [2019-11-15 23:52:18,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:18,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:18,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:18,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:18,903 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 4 states. [2019-11-15 23:52:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:19,071 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-11-15 23:52:19,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:52:19,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-15 23:52:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:19,073 INFO L225 Difference]: With dead ends: 67 [2019-11-15 23:52:19,073 INFO L226 Difference]: Without dead ends: 67 [2019-11-15 23:52:19,073 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:52:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-15 23:52:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-11-15 23:52:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 23:52:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-15 23:52:19,088 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2019-11-15 23:52:19,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:19,089 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-15 23:52:19,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-15 23:52:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:52:19,097 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:19,098 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:19,098 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:19,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2008914016, now seen corresponding path program 1 times [2019-11-15 23:52:19,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:19,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733508031] [2019-11-15 23:52:19,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:19,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:19,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:19,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733508031] [2019-11-15 23:52:19,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:19,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:52:19,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016002305] [2019-11-15 23:52:19,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:52:19,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:52:19,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:52:19,212 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2019-11-15 23:52:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:19,431 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-15 23:52:19,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:52:19,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 23:52:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:19,434 INFO L225 Difference]: With dead ends: 78 [2019-11-15 23:52:19,434 INFO L226 Difference]: Without dead ends: 78 [2019-11-15 23:52:19,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-15 23:52:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2019-11-15 23:52:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 23:52:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-15 23:52:19,445 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 15 [2019-11-15 23:52:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:19,446 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-15 23:52:19,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:52:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-15 23:52:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:52:19,447 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:19,447 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:19,447 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2125936004, now seen corresponding path program 1 times [2019-11-15 23:52:19,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:19,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53015925] [2019-11-15 23:52:19,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:19,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:19,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:19,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53015925] [2019-11-15 23:52:19,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:19,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:52:19,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281905262] [2019-11-15 23:52:19,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:52:19,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:19,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:52:19,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:19,563 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 8 states. [2019-11-15 23:52:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:20,015 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-11-15 23:52:20,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:52:20,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-15 23:52:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:20,018 INFO L225 Difference]: With dead ends: 104 [2019-11-15 23:52:20,018 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 23:52:20,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:52:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 23:52:20,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 71. [2019-11-15 23:52:20,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 23:52:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-11-15 23:52:20,026 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 17 [2019-11-15 23:52:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:20,026 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-11-15 23:52:20,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:52:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-11-15 23:52:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:52:20,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:20,028 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:20,028 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:20,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:20,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2125936003, now seen corresponding path program 1 times [2019-11-15 23:52:20,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:20,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593814276] [2019-11-15 23:52:20,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:20,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:20,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:20,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593814276] [2019-11-15 23:52:20,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:20,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:52:20,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890486092] [2019-11-15 23:52:20,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:52:20,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:20,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:52:20,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:52:20,125 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 7 states. [2019-11-15 23:52:20,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:20,393 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-11-15 23:52:20,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:52:20,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-15 23:52:20,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:20,395 INFO L225 Difference]: With dead ends: 75 [2019-11-15 23:52:20,395 INFO L226 Difference]: Without dead ends: 72 [2019-11-15 23:52:20,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:52:20,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-15 23:52:20,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2019-11-15 23:52:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 23:52:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-11-15 23:52:20,419 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 17 [2019-11-15 23:52:20,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:20,419 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-11-15 23:52:20,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:52:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-11-15 23:52:20,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:52:20,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:20,420 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:20,421 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:20,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:20,422 INFO L82 PathProgramCache]: Analyzing trace with hash -364074049, now seen corresponding path program 1 times [2019-11-15 23:52:20,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:20,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255558170] [2019-11-15 23:52:20,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:20,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:20,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:20,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255558170] [2019-11-15 23:52:20,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931109711] [2019-11-15 23:52:20,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:20,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:52:20,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:20,761 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:20,762 INFO L375 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-11-15 23:52:20,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:20,777 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 23:52:20,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:20,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-15 23:52:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:20,805 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:20,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-15 23:52:20,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267094593] [2019-11-15 23:52:20,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:52:20,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:52:20,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:52:20,806 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 7 states. [2019-11-15 23:52:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:21,012 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2019-11-15 23:52:21,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:52:21,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-15 23:52:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:21,013 INFO L225 Difference]: With dead ends: 63 [2019-11-15 23:52:21,013 INFO L226 Difference]: Without dead ends: 63 [2019-11-15 23:52:21,013 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:52:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-15 23:52:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-11-15 23:52:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-15 23:52:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-15 23:52:21,018 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 22 [2019-11-15 23:52:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:21,018 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-15 23:52:21,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:52:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-15 23:52:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:52:21,019 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:21,019 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:21,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:21,220 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:21,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:21,221 INFO L82 PathProgramCache]: Analyzing trace with hash -364074048, now seen corresponding path program 1 times [2019-11-15 23:52:21,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:21,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625690372] [2019-11-15 23:52:21,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:21,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625690372] [2019-11-15 23:52:21,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44347078] [2019-11-15 23:52:21,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:21,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:52:21,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:21,478 INFO L375 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-11-15 23:52:21,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:21,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:21,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:21,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:52:21,548 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:21,549 INFO L375 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-11-15 23:52:21,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:21,569 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-15 23:52:21,569 INFO L496 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-11-15 23:52:21,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-11-15 23:52:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:21,585 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:21,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-15 23:52:21,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570410556] [2019-11-15 23:52:21,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:52:21,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:21,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:52:21,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:21,586 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 8 states. [2019-11-15 23:52:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:21,768 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-11-15 23:52:21,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:52:21,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-15 23:52:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:21,769 INFO L225 Difference]: With dead ends: 62 [2019-11-15 23:52:21,770 INFO L226 Difference]: Without dead ends: 62 [2019-11-15 23:52:21,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:52:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-15 23:52:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-15 23:52:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 23:52:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-15 23:52:21,774 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 22 [2019-11-15 23:52:21,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:21,774 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-15 23:52:21,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:52:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-15 23:52:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:52:21,775 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:21,776 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:21,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:21,976 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:21,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:21,977 INFO L82 PathProgramCache]: Analyzing trace with hash 172097138, now seen corresponding path program 1 times [2019-11-15 23:52:21,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:21,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672598459] [2019-11-15 23:52:21,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:22,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672598459] [2019-11-15 23:52:22,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223776915] [2019-11-15 23:52:22,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:52:22,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:22,233 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:22,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 23:52:22,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378482862] [2019-11-15 23:52:22,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:52:22,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:22,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:52:22,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:52:22,234 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 9 states. [2019-11-15 23:52:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:22,449 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-11-15 23:52:22,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:52:22,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-15 23:52:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:22,450 INFO L225 Difference]: With dead ends: 81 [2019-11-15 23:52:22,450 INFO L226 Difference]: Without dead ends: 78 [2019-11-15 23:52:22,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:52:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-15 23:52:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2019-11-15 23:52:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 23:52:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-11-15 23:52:22,455 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 24 [2019-11-15 23:52:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:22,456 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-11-15 23:52:22,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:52:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-11-15 23:52:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:52:22,457 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:22,457 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:22,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:22,660 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:22,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:22,661 INFO L82 PathProgramCache]: Analyzing trace with hash -713389636, now seen corresponding path program 2 times [2019-11-15 23:52:22,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:22,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010379327] [2019-11-15 23:52:22,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:22,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:22,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:22,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010379327] [2019-11-15 23:52:22,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098809312] [2019-11-15 23:52:22,736 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:22,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:52:22,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:52:22,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:52:22,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:22,884 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:22,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-15 23:52:22,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623392015] [2019-11-15 23:52:22,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:52:22,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:22,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:52:22,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:52:22,888 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 6 states. [2019-11-15 23:52:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:23,112 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-11-15 23:52:23,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:52:23,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-15 23:52:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:23,113 INFO L225 Difference]: With dead ends: 71 [2019-11-15 23:52:23,113 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 23:52:23,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 23:52:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2019-11-15 23:52:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 23:52:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-15 23:52:23,118 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 31 [2019-11-15 23:52:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:23,118 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-15 23:52:23,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:52:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-15 23:52:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:52:23,119 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:23,122 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:23,330 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:23,331 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:23,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:23,331 INFO L82 PathProgramCache]: Analyzing trace with hash 180202334, now seen corresponding path program 1 times [2019-11-15 23:52:23,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:23,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724857674] [2019-11-15 23:52:23,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:23,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:23,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:23,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724857674] [2019-11-15 23:52:23,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867522456] [2019-11-15 23:52:23,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:23,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:52:23,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:23,838 INFO L375 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-11-15 23:52:23,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:23,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:23,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:23,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:52:23,858 INFO L375 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-11-15 23:52:23,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:23,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:23,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:23,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 23:52:23,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:23,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:23,984 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 23:52:23,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 23:52:23,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:23,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:24,000 INFO L496 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-11-15 23:52:24,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:26 [2019-11-15 23:52:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:24,106 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:24,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-15 23:52:24,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249878641] [2019-11-15 23:52:24,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:52:24,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:24,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:52:24,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:52:24,112 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 16 states. [2019-11-15 23:52:24,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:24,800 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2019-11-15 23:52:24,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:52:24,801 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-11-15 23:52:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:24,802 INFO L225 Difference]: With dead ends: 112 [2019-11-15 23:52:24,802 INFO L226 Difference]: Without dead ends: 112 [2019-11-15 23:52:24,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:52:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-15 23:52:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 79. [2019-11-15 23:52:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-15 23:52:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-11-15 23:52:24,810 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 32 [2019-11-15 23:52:24,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:24,810 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-11-15 23:52:24,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:52:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-11-15 23:52:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:52:24,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:24,812 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:25,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:25,020 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:25,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:25,020 INFO L82 PathProgramCache]: Analyzing trace with hash 180202335, now seen corresponding path program 1 times [2019-11-15 23:52:25,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:25,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342675215] [2019-11-15 23:52:25,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:25,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:25,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:25,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342675215] [2019-11-15 23:52:25,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860767018] [2019-11-15 23:52:25,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:25,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 23:52:25,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:25,441 INFO L375 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-11-15 23:52:25,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:25,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:25,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:25,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 23:52:25,465 INFO L375 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-11-15 23:52:25,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:25,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:25,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:25,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 23:52:25,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:25,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:25,570 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 23:52:25,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 23:52:25,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:25,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:25,588 INFO L496 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-11-15 23:52:25,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-11-15 23:52:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:25,677 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:25,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-15 23:52:25,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278209903] [2019-11-15 23:52:25,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:52:25,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:25,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:52:25,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:52:25,679 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 16 states. [2019-11-15 23:52:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:26,418 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2019-11-15 23:52:26,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:52:26,419 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-11-15 23:52:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:26,420 INFO L225 Difference]: With dead ends: 122 [2019-11-15 23:52:26,420 INFO L226 Difference]: Without dead ends: 122 [2019-11-15 23:52:26,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:52:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-15 23:52:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 96. [2019-11-15 23:52:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 23:52:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2019-11-15 23:52:26,426 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 32 [2019-11-15 23:52:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:26,426 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2019-11-15 23:52:26,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:52:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2019-11-15 23:52:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:52:26,438 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:26,438 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:26,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:26,642 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:26,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:26,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1291305039, now seen corresponding path program 1 times [2019-11-15 23:52:26,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:26,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364042644] [2019-11-15 23:52:26,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:26,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:26,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:52:26,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364042644] [2019-11-15 23:52:26,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:26,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:52:26,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229863633] [2019-11-15 23:52:26,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:52:26,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:26,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:52:26,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:52:26,782 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 12 states. [2019-11-15 23:52:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:27,385 INFO L93 Difference]: Finished difference Result 136 states and 164 transitions. [2019-11-15 23:52:27,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:52:27,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-15 23:52:27,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:27,387 INFO L225 Difference]: With dead ends: 136 [2019-11-15 23:52:27,387 INFO L226 Difference]: Without dead ends: 136 [2019-11-15 23:52:27,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:52:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-15 23:52:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 101. [2019-11-15 23:52:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 23:52:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2019-11-15 23:52:27,393 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 33 [2019-11-15 23:52:27,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:27,393 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2019-11-15 23:52:27,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:52:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2019-11-15 23:52:27,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:52:27,395 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:27,395 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:27,395 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:27,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1291305040, now seen corresponding path program 1 times [2019-11-15 23:52:27,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:27,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982034999] [2019-11-15 23:52:27,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:27,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:27,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:27,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982034999] [2019-11-15 23:52:27,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:27,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:52:27,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854557992] [2019-11-15 23:52:27,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:52:27,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:27,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:52:27,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:52:27,625 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand 12 states. [2019-11-15 23:52:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:28,350 INFO L93 Difference]: Finished difference Result 139 states and 167 transitions. [2019-11-15 23:52:28,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:52:28,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-15 23:52:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:28,353 INFO L225 Difference]: With dead ends: 139 [2019-11-15 23:52:28,353 INFO L226 Difference]: Without dead ends: 139 [2019-11-15 23:52:28,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:52:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-15 23:52:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2019-11-15 23:52:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 23:52:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2019-11-15 23:52:28,358 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 33 [2019-11-15 23:52:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:28,359 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2019-11-15 23:52:28,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:52:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2019-11-15 23:52:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:52:28,360 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:28,360 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:28,360 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:28,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:28,361 INFO L82 PathProgramCache]: Analyzing trace with hash -753669214, now seen corresponding path program 1 times [2019-11-15 23:52:28,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:28,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911409674] [2019-11-15 23:52:28,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:28,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:28,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:28,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911409674] [2019-11-15 23:52:28,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588996720] [2019-11-15 23:52:28,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:28,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 23:52:28,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:28,926 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:28,927 INFO L375 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-11-15 23:52:28,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:28,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:28,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:28,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-15 23:52:28,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:52:28,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:28,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:28,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:28,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-15 23:52:29,009 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:52:29,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:52:29,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:29,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:29,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:29,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-15 23:52:29,102 INFO L341 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-11-15 23:52:29,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 111 [2019-11-15 23:52:29,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:29,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:29,136 INFO L567 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-11-15 23:52:29,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:29,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2019-11-15 23:52:29,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2019-11-15 23:52:29,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:29,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:29,559 INFO L496 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-11-15 23:52:29,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:100, output treesize:77 [2019-11-15 23:52:29,686 INFO L341 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2019-11-15 23:52:29,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 99 [2019-11-15 23:52:29,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:29,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:29,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:29,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:29,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:29,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:29,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:29,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:29,694 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:29,757 INFO L567 ElimStorePlain]: treesize reduction 36, result has 48.6 percent of original size [2019-11-15 23:52:29,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:29,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:29,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:34 [2019-11-15 23:52:29,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:31,193 WARN L191 SmtUtils]: Spent 706.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-15 23:52:31,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:52:31,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:31,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:31,211 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:31,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2019-11-15 23:52:31,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899584591] [2019-11-15 23:52:31,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 23:52:31,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:31,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 23:52:31,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=860, Unknown=1, NotChecked=0, Total=930 [2019-11-15 23:52:31,213 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand 31 states. [2019-11-15 23:52:32,910 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2019-11-15 23:52:34,814 WARN L191 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 123 DAG size of output: 109 [2019-11-15 23:52:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:35,462 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2019-11-15 23:52:35,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 23:52:35,463 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 36 [2019-11-15 23:52:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:35,464 INFO L225 Difference]: With dead ends: 134 [2019-11-15 23:52:35,464 INFO L226 Difference]: Without dead ends: 134 [2019-11-15 23:52:35,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=288, Invalid=2363, Unknown=1, NotChecked=0, Total=2652 [2019-11-15 23:52:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-15 23:52:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 107. [2019-11-15 23:52:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 23:52:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-11-15 23:52:35,472 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 36 [2019-11-15 23:52:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:35,472 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-11-15 23:52:35,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 23:52:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-11-15 23:52:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:52:35,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:35,475 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:35,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:35,678 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:35,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:35,678 INFO L82 PathProgramCache]: Analyzing trace with hash -753669213, now seen corresponding path program 1 times [2019-11-15 23:52:35,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:35,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400851779] [2019-11-15 23:52:35,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:35,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:35,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:36,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400851779] [2019-11-15 23:52:36,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868135685] [2019-11-15 23:52:36,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:36,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-15 23:52:36,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:36,393 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:36,393 INFO L375 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-11-15 23:52:36,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:36,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:36,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:36,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 23:52:36,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:52:36,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:36,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:36,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:52:36,485 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:36,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:36,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:36,495 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2019-11-15 23:52:36,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:36,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:52:36,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:36,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:36,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:36,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:52:36,566 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:36,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:36,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:36,579 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2019-11-15 23:52:36,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:36,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:36,644 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:52:36,659 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:36,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 94 [2019-11-15 23:52:36,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:36,717 INFO L567 ElimStorePlain]: treesize reduction 30, result has 80.5 percent of original size [2019-11-15 23:52:36,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:36,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 74 [2019-11-15 23:52:36,721 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:36,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:36,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:36,740 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:114 [2019-11-15 23:52:37,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:37,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:37,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:37,285 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:37,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 242 treesize of output 175 [2019-11-15 23:52:37,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:37,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:37,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:37,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:37,291 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:37,351 INFO L567 ElimStorePlain]: treesize reduction 60, result has 64.9 percent of original size [2019-11-15 23:52:37,385 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:37,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 88 [2019-11-15 23:52:37,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:37,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:37,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:37,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:37,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:37,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:37,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:256, output treesize:14 [2019-11-15 23:52:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:37,557 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:37,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 36 [2019-11-15 23:52:37,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191716785] [2019-11-15 23:52:37,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-15 23:52:37,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:37,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-15 23:52:37,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1234, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 23:52:37,561 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 37 states. [2019-11-15 23:52:38,374 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-11-15 23:52:38,735 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 98 [2019-11-15 23:52:39,699 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-11-15 23:52:40,006 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2019-11-15 23:52:40,324 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2019-11-15 23:52:40,571 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2019-11-15 23:52:40,986 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-11-15 23:52:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:41,407 INFO L93 Difference]: Finished difference Result 157 states and 185 transitions. [2019-11-15 23:52:41,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 23:52:41,408 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-11-15 23:52:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:41,409 INFO L225 Difference]: With dead ends: 157 [2019-11-15 23:52:41,409 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 23:52:41,411 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=378, Invalid=3044, Unknown=0, NotChecked=0, Total=3422 [2019-11-15 23:52:41,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 23:52:41,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 121. [2019-11-15 23:52:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:52:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2019-11-15 23:52:41,416 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 36 [2019-11-15 23:52:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:41,416 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2019-11-15 23:52:41,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-15 23:52:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2019-11-15 23:52:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:52:41,417 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:41,417 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:41,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:41,618 INFO L410 AbstractCegarLoop]: === Iteration 17 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:41,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:41,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1888904167, now seen corresponding path program 1 times [2019-11-15 23:52:41,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:41,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842640061] [2019-11-15 23:52:41,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:41,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:41,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:41,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842640061] [2019-11-15 23:52:41,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:41,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:52:41,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623256459] [2019-11-15 23:52:41,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:52:41,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:41,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:52:41,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:52:41,804 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand 12 states. [2019-11-15 23:52:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:42,416 INFO L93 Difference]: Finished difference Result 151 states and 176 transitions. [2019-11-15 23:52:42,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:52:42,416 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-11-15 23:52:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:42,418 INFO L225 Difference]: With dead ends: 151 [2019-11-15 23:52:42,418 INFO L226 Difference]: Without dead ends: 151 [2019-11-15 23:52:42,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2019-11-15 23:52:42,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-15 23:52:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 121. [2019-11-15 23:52:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:52:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-11-15 23:52:42,423 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 37 [2019-11-15 23:52:42,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:42,423 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-11-15 23:52:42,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:52:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-11-15 23:52:42,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 23:52:42,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:42,424 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:42,424 INFO L410 AbstractCegarLoop]: === Iteration 18 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:42,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:42,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1573513027, now seen corresponding path program 1 times [2019-11-15 23:52:42,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:42,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598302127] [2019-11-15 23:52:42,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:42,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:42,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:42,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598302127] [2019-11-15 23:52:42,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:42,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:52:42,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874937066] [2019-11-15 23:52:42,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:52:42,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:42,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:52:42,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:52:42,621 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 12 states. [2019-11-15 23:52:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:43,208 INFO L93 Difference]: Finished difference Result 149 states and 179 transitions. [2019-11-15 23:52:43,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:52:43,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-15 23:52:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:43,211 INFO L225 Difference]: With dead ends: 149 [2019-11-15 23:52:43,211 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 23:52:43,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:52:43,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 23:52:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 127. [2019-11-15 23:52:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 23:52:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-11-15 23:52:43,216 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 38 [2019-11-15 23:52:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:43,216 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-11-15 23:52:43,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:52:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-11-15 23:52:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:52:43,217 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:43,217 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:43,218 INFO L410 AbstractCegarLoop]: === Iteration 19 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:43,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:43,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1529463384, now seen corresponding path program 1 times [2019-11-15 23:52:43,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:43,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340203714] [2019-11-15 23:52:43,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:43,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:43,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:43,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340203714] [2019-11-15 23:52:43,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529146763] [2019-11-15 23:52:43,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:43,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-15 23:52:43,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:44,003 INFO L375 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-11-15 23:52:44,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:44,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 23:52:44,054 INFO L375 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-11-15 23:52:44,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:44,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-11-15 23:52:44,214 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:44,214 INFO L375 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-11-15 23:52:44,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:44,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2019-11-15 23:52:44,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:52:44,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:44,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-15 23:52:44,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:44,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:52:44,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:44,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2019-11-15 23:52:44,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:44,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2019-11-15 23:52:44,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:44,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:44,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2019-11-15 23:52:44,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:44,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:44,785 INFO L375 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 0 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 23:52:44,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:44,814 INFO L496 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-11-15 23:52:44,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:79, output treesize:80 [2019-11-15 23:52:45,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:45,344 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:52:45,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:45,356 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:45,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 66 [2019-11-15 23:52:45,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:45,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:45,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:45,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:45,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:153, output treesize:50 [2019-11-15 23:52:45,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:45,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:45,554 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:45,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 43 [2019-11-15 23:52:45,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:45,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:45,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:45,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 23:52:45,599 INFO L567 ElimStorePlain]: treesize reduction 41, result has 53.9 percent of original size [2019-11-15 23:52:45,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-11-15 23:52:45,603 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:45,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:45,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:45,621 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:70, output treesize:33 [2019-11-15 23:52:45,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-11-15 23:52:45,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:45,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:45,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:45,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:5 [2019-11-15 23:52:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:45,709 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:45,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 41 [2019-11-15 23:52:45,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972753689] [2019-11-15 23:52:45,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-15 23:52:45,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:45,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-15 23:52:45,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1601, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 23:52:45,712 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 42 states. [2019-11-15 23:52:46,642 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-11-15 23:52:47,015 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-11-15 23:52:47,816 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-11-15 23:52:48,069 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-11-15 23:52:48,401 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 106 [2019-11-15 23:52:48,714 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 102 [2019-11-15 23:52:49,175 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2019-11-15 23:52:49,442 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-11-15 23:52:49,688 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-11-15 23:52:50,054 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-11-15 23:52:50,384 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-11-15 23:52:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:51,246 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2019-11-15 23:52:51,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-15 23:52:51,246 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 39 [2019-11-15 23:52:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:51,247 INFO L225 Difference]: With dead ends: 159 [2019-11-15 23:52:51,248 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 23:52:51,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1584 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=585, Invalid=5895, Unknown=0, NotChecked=0, Total=6480 [2019-11-15 23:52:51,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 23:52:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2019-11-15 23:52:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:52:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2019-11-15 23:52:51,254 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 39 [2019-11-15 23:52:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:51,255 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2019-11-15 23:52:51,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-15 23:52:51,255 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2019-11-15 23:52:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:52:51,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:51,256 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:51,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:51,460 INFO L410 AbstractCegarLoop]: === Iteration 20 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:51,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:51,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1534263643, now seen corresponding path program 1 times [2019-11-15 23:52:51,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:51,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617373666] [2019-11-15 23:52:51,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:51,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:51,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:52:51,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617373666] [2019-11-15 23:52:51,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:51,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:52:51,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890276427] [2019-11-15 23:52:51,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:52:51,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:51,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:52:51,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:52:51,544 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand 7 states. [2019-11-15 23:52:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:51,804 INFO L93 Difference]: Finished difference Result 140 states and 168 transitions. [2019-11-15 23:52:51,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:52:51,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-11-15 23:52:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:51,808 INFO L225 Difference]: With dead ends: 140 [2019-11-15 23:52:51,808 INFO L226 Difference]: Without dead ends: 140 [2019-11-15 23:52:51,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:52:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-15 23:52:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-11-15 23:52:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 23:52:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 168 transitions. [2019-11-15 23:52:51,813 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 168 transitions. Word has length 39 [2019-11-15 23:52:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:51,813 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 168 transitions. [2019-11-15 23:52:51,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:52:51,814 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 168 transitions. [2019-11-15 23:52:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 23:52:51,814 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:51,814 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:51,814 INFO L410 AbstractCegarLoop]: === Iteration 21 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:51,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash 165915722, now seen corresponding path program 2 times [2019-11-15 23:52:51,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:51,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625497073] [2019-11-15 23:52:51,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:51,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:51,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:51,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625497073] [2019-11-15 23:52:51,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859719722] [2019-11-15 23:52:51,915 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:52,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:52:52,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:52:52,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:52:52,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:52,086 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:52,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-15 23:52:52,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646133937] [2019-11-15 23:52:52,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:52:52,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:52,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:52:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:52:52,087 INFO L87 Difference]: Start difference. First operand 137 states and 168 transitions. Second operand 10 states. [2019-11-15 23:52:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:52,274 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-11-15 23:52:52,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:52:52,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-11-15 23:52:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:52,275 INFO L225 Difference]: With dead ends: 94 [2019-11-15 23:52:52,275 INFO L226 Difference]: Without dead ends: 83 [2019-11-15 23:52:52,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:52:52,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-15 23:52:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-15 23:52:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-15 23:52:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2019-11-15 23:52:52,277 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 40 [2019-11-15 23:52:52,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:52,277 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2019-11-15 23:52:52,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:52:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2019-11-15 23:52:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 23:52:52,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:52,278 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:52,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:52,479 INFO L410 AbstractCegarLoop]: === Iteration 22 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:52,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:52,479 INFO L82 PathProgramCache]: Analyzing trace with hash 168724710, now seen corresponding path program 1 times [2019-11-15 23:52:52,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:52,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007519972] [2019-11-15 23:52:52,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:52,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:52,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:52,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007519972] [2019-11-15 23:52:52,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385253009] [2019-11-15 23:52:52,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:53,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 23:52:53,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:53,207 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:53,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 50 [2019-11-15 23:52:53,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:53,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:53,208 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:53,231 INFO L567 ElimStorePlain]: treesize reduction 18, result has 66.0 percent of original size [2019-11-15 23:52:53,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:53,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:53,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:35 [2019-11-15 23:52:53,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:53,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:53,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2019-11-15 23:52:53,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:53,278 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:53,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-11-15 23:52:53,278 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:53,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:53,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 23:52:53,292 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:15 [2019-11-15 23:52:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:52:53,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:52:53,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 24 [2019-11-15 23:52:53,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199913389] [2019-11-15 23:52:53,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:52:53,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:53,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:52:53,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:52:53,322 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 9 states. [2019-11-15 23:52:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:53,573 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-11-15 23:52:53,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:52:53,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-11-15 23:52:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:53,576 INFO L225 Difference]: With dead ends: 82 [2019-11-15 23:52:53,576 INFO L226 Difference]: Without dead ends: 82 [2019-11-15 23:52:53,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2019-11-15 23:52:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-15 23:52:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2019-11-15 23:52:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-15 23:52:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-11-15 23:52:53,579 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 40 [2019-11-15 23:52:53,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:53,579 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-11-15 23:52:53,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:52:53,579 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-11-15 23:52:53,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 23:52:53,580 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:53,580 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:53,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:53,781 INFO L410 AbstractCegarLoop]: === Iteration 23 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:53,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash 317532742, now seen corresponding path program 1 times [2019-11-15 23:52:53,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:53,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202019497] [2019-11-15 23:52:53,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:53,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:53,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:54,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202019497] [2019-11-15 23:52:54,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:54,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 23:52:54,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616915540] [2019-11-15 23:52:54,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:52:54,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:54,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:52:54,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:52:54,013 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 16 states. [2019-11-15 23:52:54,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:54,749 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-11-15 23:52:54,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:52:54,750 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-11-15 23:52:54,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:54,751 INFO L225 Difference]: With dead ends: 83 [2019-11-15 23:52:54,751 INFO L226 Difference]: Without dead ends: 83 [2019-11-15 23:52:54,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2019-11-15 23:52:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-15 23:52:54,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2019-11-15 23:52:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 23:52:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-11-15 23:52:54,755 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 40 [2019-11-15 23:52:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:54,755 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-11-15 23:52:54,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:52:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-11-15 23:52:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:52:54,756 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:54,756 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:54,756 INFO L410 AbstractCegarLoop]: === Iteration 24 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash 935498779, now seen corresponding path program 1 times [2019-11-15 23:52:54,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:54,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462946521] [2019-11-15 23:52:54,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:54,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:54,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:52:54,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462946521] [2019-11-15 23:52:54,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:54,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:52:54,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782988812] [2019-11-15 23:52:54,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:52:54,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:54,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:52:54,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:52:54,883 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 11 states. [2019-11-15 23:52:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:55,156 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-11-15 23:52:55,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:52:55,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-11-15 23:52:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:55,157 INFO L225 Difference]: With dead ends: 82 [2019-11-15 23:52:55,157 INFO L226 Difference]: Without dead ends: 82 [2019-11-15 23:52:55,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:52:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-15 23:52:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2019-11-15 23:52:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 23:52:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-11-15 23:52:55,160 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 41 [2019-11-15 23:52:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:55,160 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-11-15 23:52:55,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:52:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-11-15 23:52:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:52:55,160 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:55,161 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:55,161 INFO L410 AbstractCegarLoop]: === Iteration 25 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:55,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:55,161 INFO L82 PathProgramCache]: Analyzing trace with hash -592043865, now seen corresponding path program 1 times [2019-11-15 23:52:55,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:55,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054402203] [2019-11-15 23:52:55,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:55,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:55,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:52:55,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054402203] [2019-11-15 23:52:55,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:55,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:52:55,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947038362] [2019-11-15 23:52:55,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:52:55,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:55,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:52:55,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:55,241 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 8 states. [2019-11-15 23:52:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:55,428 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-15 23:52:55,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:52:55,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-15 23:52:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:55,429 INFO L225 Difference]: With dead ends: 79 [2019-11-15 23:52:55,429 INFO L226 Difference]: Without dead ends: 79 [2019-11-15 23:52:55,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:52:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-15 23:52:55,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2019-11-15 23:52:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-15 23:52:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-11-15 23:52:55,431 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 45 [2019-11-15 23:52:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:55,432 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-11-15 23:52:55,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:52:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-11-15 23:52:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:52:55,432 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:55,432 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:55,432 INFO L410 AbstractCegarLoop]: === Iteration 26 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:55,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2018469527, now seen corresponding path program 1 times [2019-11-15 23:52:55,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:55,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180682091] [2019-11-15 23:52:55,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:55,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:55,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:52:55,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180682091] [2019-11-15 23:52:55,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071305720] [2019-11-15 23:52:55,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:55,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:52:55,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:52:55,643 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:55,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2019-11-15 23:52:55,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120677467] [2019-11-15 23:52:55,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:52:55,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:55,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:52:55,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:55,644 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 8 states. [2019-11-15 23:52:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:55,769 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-11-15 23:52:55,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:52:55,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-15 23:52:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:55,770 INFO L225 Difference]: With dead ends: 81 [2019-11-15 23:52:55,770 INFO L226 Difference]: Without dead ends: 81 [2019-11-15 23:52:55,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:52:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-15 23:52:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2019-11-15 23:52:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 23:52:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-11-15 23:52:55,772 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 47 [2019-11-15 23:52:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:55,773 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-11-15 23:52:55,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:52:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-11-15 23:52:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:52:55,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:55,773 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:55,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:55,977 INFO L410 AbstractCegarLoop]: === Iteration 27 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:55,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:55,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1855543946, now seen corresponding path program 1 times [2019-11-15 23:52:55,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:55,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202924302] [2019-11-15 23:52:55,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:55,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:55,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:56,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202924302] [2019-11-15 23:52:56,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187621011] [2019-11-15 23:52:56,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:52:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:56,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-15 23:52:56,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:56,674 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:56,675 INFO L375 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-11-15 23:52:56,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:56,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:56,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:56,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 23:52:56,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:52:56,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:56,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:56,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:56,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-15 23:52:56,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:56,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:52:56,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:56,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:56,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:56,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-11-15 23:52:57,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:57,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:52:57,015 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:57,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 60 [2019-11-15 23:52:57,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:57,071 INFO L567 ElimStorePlain]: treesize reduction 40, result has 54.0 percent of original size [2019-11-15 23:52:57,072 INFO L496 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-11-15 23:52:57,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:47 [2019-11-15 23:52:57,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-11-15 23:52:57,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:57,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:57,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:57,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2019-11-15 23:52:57,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:57,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:57,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:57,746 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:52:57,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:57,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:57,749 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:52:57,756 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:57,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 31 [2019-11-15 23:52:57,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:57,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:57,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:57,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:1 [2019-11-15 23:52:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:57,770 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:57,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 43 [2019-11-15 23:52:57,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195957027] [2019-11-15 23:52:57,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 23:52:57,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:57,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 23:52:57,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1692, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 23:52:57,772 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 43 states. [2019-11-15 23:52:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:59,684 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-11-15 23:52:59,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 23:52:59,685 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 48 [2019-11-15 23:52:59,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:59,685 INFO L225 Difference]: With dead ends: 87 [2019-11-15 23:52:59,685 INFO L226 Difference]: Without dead ends: 80 [2019-11-15 23:52:59,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=376, Invalid=3656, Unknown=0, NotChecked=0, Total=4032 [2019-11-15 23:52:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-15 23:52:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-11-15 23:52:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 23:52:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-11-15 23:52:59,689 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 48 [2019-11-15 23:52:59,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:59,690 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-11-15 23:52:59,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 23:52:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-11-15 23:52:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:52:59,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:59,690 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:59,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:59,891 INFO L410 AbstractCegarLoop]: === Iteration 28 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:52:59,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:59,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1558585183, now seen corresponding path program 1 times [2019-11-15 23:52:59,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:59,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79560667] [2019-11-15 23:52:59,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:59,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:59,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:00,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79560667] [2019-11-15 23:53:00,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721131809] [2019-11-15 23:53:00,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:53:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:01,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 78 conjunts are in the unsatisfiable core [2019-11-15 23:53:01,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:01,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:01,210 INFO L375 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-11-15 23:53:01,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:01,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:01,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:01,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-15 23:53:01,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:53:01,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:01,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:01,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:01,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-15 23:53:01,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:01,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:53:01,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:01,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:01,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:01,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-15 23:53:01,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:01,399 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:01,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 106 [2019-11-15 23:53:01,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:01,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:01,426 INFO L567 ElimStorePlain]: treesize reduction 46, result has 45.2 percent of original size [2019-11-15 23:53:01,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:01,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-11-15 23:53:01,709 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_4|], 6=[|v_#memory_$Pointer$.base_BEFORE_CALL_7|]} [2019-11-15 23:53:01,712 INFO L375 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 7 treesize of output 3 [2019-11-15 23:53:01,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:01,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:01,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:01,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 59 [2019-11-15 23:53:01,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:01,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:01,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:01,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:01,744 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:01,758 INFO L567 ElimStorePlain]: treesize reduction 28, result has 33.3 percent of original size [2019-11-15 23:53:01,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:01,759 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:7 [2019-11-15 23:53:02,802 WARN L191 SmtUtils]: Spent 816.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-15 23:53:03,866 WARN L191 SmtUtils]: Spent 989.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 23:53:04,794 WARN L191 SmtUtils]: Spent 866.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-15 23:53:04,818 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:04,818 INFO L375 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 16 treesize of output 40 [2019-11-15 23:53:04,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:04,863 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.5 percent of original size [2019-11-15 23:53:04,864 INFO L496 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-11-15 23:53:04,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:66 [2019-11-15 23:53:05,915 WARN L191 SmtUtils]: Spent 964.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-15 23:53:05,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,324 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_5|], 66=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-11-15 23:53:09,329 INFO L375 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 273 treesize of output 229 [2019-11-15 23:53:09,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:09,334 INFO L375 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 313 treesize of output 261 [2019-11-15 23:53:09,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:09,392 INFO L567 ElimStorePlain]: treesize reduction 235, result has 46.7 percent of original size [2019-11-15 23:53:09,563 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-11-15 23:53:09,564 INFO L341 Elim1Store]: treesize reduction 27, result has 88.0 percent of original size [2019-11-15 23:53:09,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 237 treesize of output 290 [2019-11-15 23:53:09,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,625 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:09,813 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-11-15 23:53:09,813 INFO L567 ElimStorePlain]: treesize reduction 176, result has 50.6 percent of original size [2019-11-15 23:53:09,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:09,830 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:587, output treesize:180 [2019-11-15 23:53:09,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:09,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:09,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:10,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:10,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:10,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:10,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:10,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:10,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:10,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:10,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:10,926 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-11-15 23:53:11,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:11,172 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 6=[v_prenex_9, v_prenex_11]} [2019-11-15 23:53:11,179 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:11,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 32 [2019-11-15 23:53:11,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:11,288 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-15 23:53:11,289 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.6 percent of original size [2019-11-15 23:53:11,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:11,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:11,312 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:11,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 65 [2019-11-15 23:53:11,313 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:11,376 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.9 percent of original size [2019-11-15 23:53:11,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:11,399 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:11,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 77 [2019-11-15 23:53:11,400 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:11,452 INFO L567 ElimStorePlain]: treesize reduction 28, result has 70.2 percent of original size [2019-11-15 23:53:11,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-11-15 23:53:11,453 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:207, output treesize:39 [2019-11-15 23:53:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:11,545 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:11,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 47 [2019-11-15 23:53:11,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137547359] [2019-11-15 23:53:11,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-11-15 23:53:11,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-15 23:53:11,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2118, Unknown=1, NotChecked=0, Total=2256 [2019-11-15 23:53:11,547 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 48 states. [2019-11-15 23:53:13,936 WARN L191 SmtUtils]: Spent 954.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-15 23:53:14,953 WARN L191 SmtUtils]: Spent 961.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-15 23:53:16,087 WARN L191 SmtUtils]: Spent 995.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 23:53:17,645 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-11-15 23:53:18,206 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 98 [2019-11-15 23:53:18,502 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 104 [2019-11-15 23:53:18,824 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 108 [2019-11-15 23:53:19,114 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 104 [2019-11-15 23:53:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:19,727 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-11-15 23:53:19,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 23:53:19,728 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 49 [2019-11-15 23:53:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:19,728 INFO L225 Difference]: With dead ends: 96 [2019-11-15 23:53:19,729 INFO L226 Difference]: Without dead ends: 96 [2019-11-15 23:53:19,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=407, Invalid=4848, Unknown=1, NotChecked=0, Total=5256 [2019-11-15 23:53:19,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-15 23:53:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2019-11-15 23:53:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-15 23:53:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-11-15 23:53:19,734 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 49 [2019-11-15 23:53:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:19,734 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-11-15 23:53:19,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-11-15 23:53:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-11-15 23:53:19,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:53:19,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:19,735 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:19,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:19,942 INFO L410 AbstractCegarLoop]: === Iteration 29 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:53:19,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:19,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1558585184, now seen corresponding path program 1 times [2019-11-15 23:53:19,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:19,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331708862] [2019-11-15 23:53:19,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:19,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:19,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:20,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331708862] [2019-11-15 23:53:20,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59343853] [2019-11-15 23:53:20,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:53:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:20,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 76 conjunts are in the unsatisfiable core [2019-11-15 23:53:20,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:20,994 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:20,994 INFO L375 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-11-15 23:53:20,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:20,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:21,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:21,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-15 23:53:21,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:53:21,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:21,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:21,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:21,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-15 23:53:21,101 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:53:21,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:53:21,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:21,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:21,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:21,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-15 23:53:21,155 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:53:21,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-15 23:53:21,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:21,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:21,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:21,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-11-15 23:53:21,682 INFO L375 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-11-15 23:53:21,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:21,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:21,692 INFO L375 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 25 treesize of output 21 [2019-11-15 23:53:21,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:21,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:21,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:21,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:47 [2019-11-15 23:53:21,778 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_17|], 12=[|v_#memory_$Pointer$.offset_BEFORE_CALL_7|]} [2019-11-15 23:53:21,782 INFO L375 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 89 treesize of output 69 [2019-11-15 23:53:21,782 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:21,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:21,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:21,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 70 [2019-11-15 23:53:21,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,816 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:21,852 INFO L567 ElimStorePlain]: treesize reduction 28, result has 64.1 percent of original size [2019-11-15 23:53:21,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:21,852 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:46 [2019-11-15 23:53:22,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-11-15 23:53:22,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:22,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:22,051 INFO L375 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 26 treesize of output 14 [2019-11-15 23:53:22,051 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:22,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:22,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:22,057 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2019-11-15 23:53:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:22,138 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:22,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 45 [2019-11-15 23:53:22,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649809129] [2019-11-15 23:53:22,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-15 23:53:22,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:22,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-15 23:53:22,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1950, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 23:53:22,139 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 46 states. [2019-11-15 23:53:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:25,285 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2019-11-15 23:53:25,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-15 23:53:25,285 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 49 [2019-11-15 23:53:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:25,286 INFO L225 Difference]: With dead ends: 105 [2019-11-15 23:53:25,286 INFO L226 Difference]: Without dead ends: 105 [2019-11-15 23:53:25,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=452, Invalid=5098, Unknown=0, NotChecked=0, Total=5550 [2019-11-15 23:53:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-15 23:53:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2019-11-15 23:53:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-15 23:53:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2019-11-15 23:53:25,291 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 49 [2019-11-15 23:53:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:25,291 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2019-11-15 23:53:25,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-15 23:53:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2019-11-15 23:53:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:53:25,292 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:25,292 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:53:25,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:25,493 INFO L410 AbstractCegarLoop]: === Iteration 30 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:53:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1080266094, now seen corresponding path program 1 times [2019-11-15 23:53:25,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:25,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040677720] [2019-11-15 23:53:25,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:25,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:25,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:27,361 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:27,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040677720] [2019-11-15 23:53:27,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752242612] [2019-11-15 23:53:27,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:53:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:27,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 115 conjunts are in the unsatisfiable core [2019-11-15 23:53:27,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:27,541 INFO L375 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-11-15 23:53:27,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:27,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:27,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:27,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 23:53:27,591 INFO L375 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-11-15 23:53:27,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:27,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:27,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:27,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-11-15 23:53:27,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:53:27,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:27,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:27,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:53:27,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:27,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:27,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:27,825 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-11-15 23:53:27,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:27,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:53:27,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:27,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:27,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:27,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:53:27,942 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:27,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:27,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:27,958 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2019-11-15 23:53:28,119 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:28,119 INFO L375 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-11-15 23:53:28,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:28,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:65 [2019-11-15 23:53:28,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:28,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-11-15 23:53:28,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:28,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:28,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-11-15 23:53:28,276 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:28,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:68 [2019-11-15 23:53:28,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:28,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-15 23:53:28,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:28,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:28,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-15 23:53:28,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:28,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,450 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2019-11-15 23:53:28,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:28,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:28,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-11-15 23:53:28,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:28,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:28,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:28,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-11-15 23:53:28,603 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:28,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:104 [2019-11-15 23:53:28,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:28,759 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:28,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 155 [2019-11-15 23:53:28,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,835 INFO L567 ElimStorePlain]: treesize reduction 62, result has 75.9 percent of original size [2019-11-15 23:53:28,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:28,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:28,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:28,842 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:28,842 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:28,858 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:28,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 141 [2019-11-15 23:53:28,859 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,938 INFO L567 ElimStorePlain]: treesize reduction 50, result has 76.6 percent of original size [2019-11-15 23:53:28,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:28,939 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:226, output treesize:164 [2019-11-15 23:53:29,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:29,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:29,295 INFO L375 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 0 case distinctions, treesize of input 21 treesize of output 25 [2019-11-15 23:53:29,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:29,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:29,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:29,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:176, output treesize:177 [2019-11-15 23:53:29,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:29,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:29,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:29,803 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:29,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 303 treesize of output 255 [2019-11-15 23:53:29,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:29,825 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:29,938 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-11-15 23:53:29,938 INFO L567 ElimStorePlain]: treesize reduction 146, result has 47.3 percent of original size [2019-11-15 23:53:29,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:29,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:29,956 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:29,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 58 [2019-11-15 23:53:29,959 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:29,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:29,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:29,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:328, output treesize:36 [2019-11-15 23:53:31,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:31,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:31,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:31,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:31,123 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:31,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 84 treesize of output 164 [2019-11-15 23:53:31,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:31,282 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-15 23:53:31,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:31,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:31,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:31,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:31,506 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-15 23:53:31,506 INFO L341 Elim1Store]: treesize reduction 19, result has 93.6 percent of original size [2019-11-15 23:53:31,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 559 treesize of output 496 [2019-11-15 23:53:31,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:31,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:32,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:32,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,389 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:33,617 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2019-11-15 23:53:33,617 INFO L567 ElimStorePlain]: treesize reduction 497, result has 38.9 percent of original size [2019-11-15 23:53:33,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:33,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:33,647 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:33,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 169 [2019-11-15 23:53:33,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:33,658 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:33,783 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-11-15 23:53:33,783 INFO L567 ElimStorePlain]: treesize reduction 102, result has 66.2 percent of original size [2019-11-15 23:53:33,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:33,784 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:647, output treesize:166 [2019-11-15 23:53:34,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:34,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:34,302 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:34,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:34,303 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:34,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:34,305 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:34,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:34,323 INFO L341 Elim1Store]: treesize reduction 8, result has 71.4 percent of original size [2019-11-15 23:53:34,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 148 treesize of output 90 [2019-11-15 23:53:34,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:34,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:34,325 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:34,375 INFO L567 ElimStorePlain]: treesize reduction 17, result has 86.1 percent of original size [2019-11-15 23:53:34,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:34,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:34,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:34,390 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:34,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 61 [2019-11-15 23:53:34,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:34,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:34,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:34,402 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:206, output treesize:7 [2019-11-15 23:53:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:34,433 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:34,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 61 [2019-11-15 23:53:34,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759207560] [2019-11-15 23:53:34,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-11-15 23:53:34,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:34,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-11-15 23:53:34,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3473, Unknown=0, NotChecked=0, Total=3660 [2019-11-15 23:53:34,435 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 61 states. [2019-11-15 23:53:36,454 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-15 23:53:37,916 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-15 23:53:38,983 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 90 [2019-11-15 23:53:39,228 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 85 [2019-11-15 23:53:39,618 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 73 [2019-11-15 23:53:39,853 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-11-15 23:53:40,460 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-11-15 23:53:41,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:41,207 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-11-15 23:53:41,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-15 23:53:41,209 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 52 [2019-11-15 23:53:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:41,209 INFO L225 Difference]: With dead ends: 95 [2019-11-15 23:53:41,209 INFO L226 Difference]: Without dead ends: 95 [2019-11-15 23:53:41,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=599, Invalid=9103, Unknown=0, NotChecked=0, Total=9702 [2019-11-15 23:53:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-15 23:53:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2019-11-15 23:53:41,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-15 23:53:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2019-11-15 23:53:41,214 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 52 [2019-11-15 23:53:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:41,215 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2019-11-15 23:53:41,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-11-15 23:53:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2019-11-15 23:53:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:53:41,215 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:41,216 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:53:41,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:41,416 INFO L410 AbstractCegarLoop]: === Iteration 31 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:53:41,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:41,417 INFO L82 PathProgramCache]: Analyzing trace with hash 871494441, now seen corresponding path program 1 times [2019-11-15 23:53:41,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:41,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65327757] [2019-11-15 23:53:41,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:41,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:41,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:42,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65327757] [2019-11-15 23:53:42,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317728026] [2019-11-15 23:53:42,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:53:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:42,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-15 23:53:42,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:42,253 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:42,254 INFO L375 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-11-15 23:53:42,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:42,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:42,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:42,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-15 23:53:42,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:53:42,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:42,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:42,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:42,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-15 23:53:42,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:42,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:53:42,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:42,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:42,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:42,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-15 23:53:42,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:42,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-15 23:53:42,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:42,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:42,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:42,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2019-11-15 23:53:42,775 INFO L375 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 25 treesize of output 21 [2019-11-15 23:53:42,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:42,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:42,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:42,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-15 23:53:42,815 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_21|], 12=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_21|]} [2019-11-15 23:53:42,819 INFO L375 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 64 treesize of output 48 [2019-11-15 23:53:42,819 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:42,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:42,846 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:42,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 62 [2019-11-15 23:53:42,847 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:42,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:42,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:42,851 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:11 [2019-11-15 23:53:42,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 23:53:42,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:42,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:42,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:42,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 23:53:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:42,967 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:42,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 42 [2019-11-15 23:53:42,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674851761] [2019-11-15 23:53:42,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 23:53:42,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:42,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 23:53:42,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1675, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 23:53:42,968 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 43 states. [2019-11-15 23:53:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:45,742 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2019-11-15 23:53:45,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-11-15 23:53:45,743 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 53 [2019-11-15 23:53:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:45,744 INFO L225 Difference]: With dead ends: 120 [2019-11-15 23:53:45,744 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:53:45,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=675, Invalid=5805, Unknown=0, NotChecked=0, Total=6480 [2019-11-15 23:53:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:53:45,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2019-11-15 23:53:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-15 23:53:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2019-11-15 23:53:45,748 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 53 [2019-11-15 23:53:45,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:45,748 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-11-15 23:53:45,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 23:53:45,748 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2019-11-15 23:53:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:53:45,749 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:45,749 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:45,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:45,949 INFO L410 AbstractCegarLoop]: === Iteration 32 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:53:45,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:45,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1246523955, now seen corresponding path program 1 times [2019-11-15 23:53:45,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:45,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673595519] [2019-11-15 23:53:45,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:45,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:45,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:46,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673595519] [2019-11-15 23:53:46,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362814828] [2019-11-15 23:53:46,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/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-11-15 23:53:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:46,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 65 conjunts are in the unsatisfiable core [2019-11-15 23:53:46,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:46,806 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:46,807 INFO L375 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-11-15 23:53:46,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:46,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:46,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:46,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:10 [2019-11-15 23:53:46,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:53:46,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:46,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:46,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:46,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 23:53:46,891 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:53:46,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:53:46,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:46,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:46,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:46,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-11-15 23:53:46,985 INFO L341 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-11-15 23:53:46,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 111 [2019-11-15 23:53:46,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:46,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:46,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:46,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:47,008 INFO L567 ElimStorePlain]: treesize reduction 92, result has 33.8 percent of original size [2019-11-15 23:53:47,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:47,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2019-11-15 23:53:47,267 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_15|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_18|]} [2019-11-15 23:53:47,269 INFO L375 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 86 treesize of output 70 [2019-11-15 23:53:47,270 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:47,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:47,346 INFO L341 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2019-11-15 23:53:47,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 96 [2019-11-15 23:53:47,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,350 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:47,387 INFO L567 ElimStorePlain]: treesize reduction 36, result has 52.6 percent of original size [2019-11-15 23:53:47,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:47,388 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:7 [2019-11-15 23:53:47,561 INFO L375 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 25 treesize of output 21 [2019-11-15 23:53:47,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:47,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:47,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:47,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-15 23:53:47,609 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_16|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_19|]} [2019-11-15 23:53:47,610 INFO L375 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 107 treesize of output 87 [2019-11-15 23:53:47,611 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:47,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:47,743 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-11-15 23:53:47,744 INFO L341 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2019-11-15 23:53:47,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 103 [2019-11-15 23:53:47,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,748 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:47,813 INFO L567 ElimStorePlain]: treesize reduction 52, result has 46.4 percent of original size [2019-11-15 23:53:47,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:47,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:47,814 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:45 [2019-11-15 23:53:47,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:48,866 WARN L191 SmtUtils]: Spent 961.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-15 23:53:48,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:48,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:48,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:49,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-15 23:53:49,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:49,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:49,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:49,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-15 23:53:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:49,784 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:49,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 42 [2019-11-15 23:53:49,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307717731] [2019-11-15 23:53:49,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 23:53:49,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:49,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 23:53:49,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1700, Unknown=1, NotChecked=0, Total=1806 [2019-11-15 23:53:49,785 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 43 states. [2019-11-15 23:53:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:52,508 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-15 23:53:52,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 23:53:52,509 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 54 [2019-11-15 23:53:52,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:52,510 INFO L225 Difference]: With dead ends: 109 [2019-11-15 23:53:52,510 INFO L226 Difference]: Without dead ends: 109 [2019-11-15 23:53:52,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=420, Invalid=4549, Unknown=1, NotChecked=0, Total=4970 [2019-11-15 23:53:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-15 23:53:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2019-11-15 23:53:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-15 23:53:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2019-11-15 23:53:52,513 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 54 [2019-11-15 23:53:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:52,513 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2019-11-15 23:53:52,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 23:53:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2019-11-15 23:53:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:53:52,514 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:52,514 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:52,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:52,715 INFO L410 AbstractCegarLoop]: === Iteration 33 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:53:52,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash 692280441, now seen corresponding path program 1 times [2019-11-15 23:53:52,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:52,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192182326] [2019-11-15 23:53:52,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:52,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:52,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:53:54,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192182326] [2019-11-15 23:53:54,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225494036] [2019-11-15 23:53:54,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:54,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-15 23:53:54,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:54,241 INFO L375 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-11-15 23:53:54,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:54,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:54,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:54,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-11-15 23:53:54,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:53:54,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:54,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:54,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:54,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2019-11-15 23:53:54,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:54,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:53:54,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:54,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:54,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:54,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2019-11-15 23:53:54,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:54,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:54,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 127 [2019-11-15 23:53:54,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:54,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:54,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:54,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 23:53:54,729 INFO L567 ElimStorePlain]: treesize reduction 314, result has 21.1 percent of original size [2019-11-15 23:53:54,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:54,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:93, output treesize:83 [2019-11-15 23:53:55,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:55,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:55,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:55,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:55,231 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:55,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2019-11-15 23:53:55,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:55,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:55,266 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_17|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_21|]} [2019-11-15 23:53:55,270 INFO L375 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 98 treesize of output 74 [2019-11-15 23:53:55,270 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:55,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:55,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:55,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:55,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:55,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:55,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 69 [2019-11-15 23:53:55,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:55,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:55,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:55,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:55,343 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:55,385 INFO L567 ElimStorePlain]: treesize reduction 32, result has 47.5 percent of original size [2019-11-15 23:53:55,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:55,386 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:151, output treesize:10 [2019-11-15 23:53:57,561 WARN L191 SmtUtils]: Spent 811.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-15 23:53:58,598 WARN L191 SmtUtils]: Spent 968.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-15 23:53:59,652 WARN L191 SmtUtils]: Spent 950.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-15 23:54:07,380 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_18|], 41=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_25|]} [2019-11-15 23:54:07,383 INFO L375 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 303 treesize of output 243 [2019-11-15 23:54:07,384 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:54:07,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:54:07,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:07,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:07,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:07,591 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-11-15 23:54:07,592 INFO L341 Elim1Store]: treesize reduction 27, result has 89.0 percent of original size [2019-11-15 23:54:07,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 278 treesize of output 311 [2019-11-15 23:54:07,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:07,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,639 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:54:07,775 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2019-11-15 23:54:07,775 INFO L567 ElimStorePlain]: treesize reduction 268, result has 32.2 percent of original size [2019-11-15 23:54:07,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 23:54:07,776 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:321, output treesize:127 [2019-11-15 23:54:07,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:07,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:08,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:08,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:08,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:08,197 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:54:08,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 140 [2019-11-15 23:54:08,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:54:08,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:08,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:08,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:08,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:08,211 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:54:08,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 90 [2019-11-15 23:54:08,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:54:08,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:54:08,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:08,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:08,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:08,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:54:08,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 109 treesize of output 145 [2019-11-15 23:54:08,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,387 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:54:08,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:08,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:08,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:54:08,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 84 [2019-11-15 23:54:08,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,430 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:54:08,544 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2019-11-15 23:54:08,545 INFO L567 ElimStorePlain]: treesize reduction 106, result has 38.0 percent of original size [2019-11-15 23:54:08,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:08,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:54:08,545 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:227, output treesize:7 [2019-11-15 23:54:10,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:10,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:10,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:10,887 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:54:10,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 161 treesize of output 175 [2019-11-15 23:54:10,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,900 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:54:10,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:10,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:54:10,927 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:54:10,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 114 [2019-11-15 23:54:10,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:10,929 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:54:11,027 INFO L567 ElimStorePlain]: treesize reduction 106, result has 54.1 percent of original size [2019-11-15 23:54:11,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:54:11,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-15 23:54:11,029 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:273, output treesize:148 [2019-11-15 23:54:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:11,311 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:54:11,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 59 [2019-11-15 23:54:11,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790517374] [2019-11-15 23:54:11,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-11-15 23:54:11,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:11,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-11-15 23:54:11,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3342, Unknown=7, NotChecked=0, Total=3540 [2019-11-15 23:54:11,312 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 60 states. [2019-11-15 23:54:12,346 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-11-15 23:54:17,496 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-15 23:54:19,706 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-15 23:54:21,985 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-15 23:54:27,764 WARN L191 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-11-15 23:54:29,876 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-15 23:54:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:55,914 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2019-11-15 23:54:55,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 23:54:55,915 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 63 [2019-11-15 23:54:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:55,916 INFO L225 Difference]: With dead ends: 117 [2019-11-15 23:54:55,916 INFO L226 Difference]: Without dead ends: 114 [2019-11-15 23:54:55,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 45.9s TimeCoverageRelationStatistics Valid=408, Invalid=6045, Unknown=27, NotChecked=0, Total=6480 [2019-11-15 23:54:55,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-15 23:54:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-11-15 23:54:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 23:54:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2019-11-15 23:54:55,920 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 63 [2019-11-15 23:54:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:55,920 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2019-11-15 23:54:55,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-11-15 23:54:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2019-11-15 23:54:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:54:55,920 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:55,920 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:56,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:54:56,121 INFO L410 AbstractCegarLoop]: === Iteration 34 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION]=== [2019-11-15 23:54:56,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash -10552966, now seen corresponding path program 1 times [2019-11-15 23:54:56,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:56,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066803548] [2019-11-15 23:54:56,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:56,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:56,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 23:54:56,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066803548] [2019-11-15 23:54:56,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:56,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:54:56,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964793610] [2019-11-15 23:54:56,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:54:56,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:56,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:54:56,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:54:56,251 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 9 states. [2019-11-15 23:54:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:56,463 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2019-11-15 23:54:56,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:54:56,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-11-15 23:54:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:56,463 INFO L225 Difference]: With dead ends: 60 [2019-11-15 23:54:56,463 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:54:56,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:54:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:54:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:54:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:54:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:54:56,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2019-11-15 23:54:56,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:56,464 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:54:56,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:54:56,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:54:56,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:54:56,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:54:56 BoogieIcfgContainer [2019-11-15 23:54:56,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:54:56,473 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:54:56,473 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:54:56,474 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:54:56,474 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:17" (3/4) ... [2019-11-15 23:54:56,477 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:54:56,483 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-15 23:54:56,483 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-15 23:54:56,483 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2019-11-15 23:54:56,484 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-15 23:54:56,484 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-15 23:54:56,484 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-15 23:54:56,484 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-11-15 23:54:56,484 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_remove_first [2019-11-15 23:54:56,492 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-15 23:54:56,492 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-15 23:54:56,492 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 23:54:56,560 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_30ad71e2-080f-4d08-8c7c-d2db80a6f5e7/bin/uautomizer/witness.graphml [2019-11-15 23:54:56,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:54:56,564 INFO L168 Benchmark]: Toolchain (without parser) took 159869.35 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 783.8 MB). Free memory was 943.4 MB in the beginning and 926.0 MB in the end (delta: 17.4 MB). Peak memory consumption was 801.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:56,564 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:54:56,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:56,571 INFO L168 Benchmark]: Boogie Preprocessor took 55.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:56,573 INFO L168 Benchmark]: RCFGBuilder took 621.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:56,573 INFO L168 Benchmark]: TraceAbstraction took 158542.51 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 643.3 MB). Free memory was 1.0 GB in the beginning and 951.8 MB in the end (delta: 93.6 MB). Peak memory consumption was 736.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:56,573 INFO L168 Benchmark]: Witness Printer took 87.23 ms. Allocated memory is still 1.8 GB. Free memory was 951.8 MB in the beginning and 926.0 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:56,579 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 556.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 621.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 158542.51 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 643.3 MB). Free memory was 1.0 GB in the beginning and 951.8 MB in the end (delta: 93.6 MB). Peak memory consumption was 736.9 MB. Max. memory is 11.5 GB. * Witness Printer took 87.23 ms. Allocated memory is still 1.8 GB. Free memory was 951.8 MB in the beginning and 926.0 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 92 locations, 30 error locations. Result: SAFE, OverallTime: 158.4s, OverallIterations: 34, TraceHistogramMax: 3, AutomataDifference: 92.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1107 SDtfs, 4356 SDslu, 5450 SDs, 0 SdLazy, 22236 SolverSat, 1039 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 32.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1722 GetRequests, 669 SyntacticMatches, 32 SemanticMatches, 1021 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12009 ImplicationChecksByTransitivity, 104.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 513 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 58.3s InterpolantComputationTime, 1994 NumberOfCodeBlocks, 1994 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1941 ConstructedInterpolants, 176 QuantifiedInterpolants, 1654051 SizeOfPredicates, 283 NumberOfNonLiveVariables, 4409 ConjunctsInSsa, 872 ConjunctsInUnsatCore, 53 InterpolantComputations, 16 PerfectInterpolantSequences, 224/573 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...