./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5758efa3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/duplets.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 c261d11d6e37ef6eda45455c8074b5a0eac3352b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/duplets.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 c261d11d6e37ef6eda45455c8074b5a0eac3352b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (exists ((v_mkdup_~j~0_73 (_ BitVec 32)) (|v_main_~#i~2.base_35| (_ BitVec 32)) (|v_main_~#j~2.base_35| (_ BitVec 32)) (v_finddup_~j~1_116 (_ BitVec 32)) (v_mkdup_~i~0_73 (_ BitVec 32))) (forall ((v_prenex_40 (_ BitVec 32)) (v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse7 (bvmul v_prenex_42 (_ bv4 32)))) (let ((.cse0 (bvadd |mkdup_#in~a.offset| .cse7 (_ bv4 32))) (.cse3 (bvadd |mkdup_#in~a.offset| .cse7))) (or (not (bvule .cse0 (select (store (store |#length| v_prenex_40 (_ bv4 32)) v_prenex_41 (_ bv4 32)) |mkdup_#in~a.base|))) (let ((.cse1 (bvmul v_finddup_~j~1_116 (_ bv4 32)))) (let ((.cse2 (bvadd |mkdup_#in~a.offset| .cse1 (_ bv4 32)))) (and (bvule (bvadd |mkdup_#in~a.offset| .cse1) .cse2) (bvult |#StackHeapBarrier| |v_main_~#j~2.base_35|) (not (= (bvmul v_mkdup_~j~0_73 (_ bv4 32)) .cse1)) (bvule .cse2 (select (store (store |#length| |v_main_~#i~2.base_35| (_ bv4 32)) |v_main_~#j~2.base_35| (_ bv4 32)) |mkdup_#in~a.base|)) (= (select |#valid| |v_main_~#i~2.base_35|) (_ bv0 1)) (bvsle (_ bv0 32) v_mkdup_~j~0_73) (bvslt v_mkdup_~i~0_73 |mkdup_#in~n|) (not (= .cse1 (bvmul v_mkdup_~i~0_73 (_ bv4 32)))) (not (= v_mkdup_~j~0_73 v_mkdup_~i~0_73)) (bvsle (_ bv0 32) v_mkdup_~i~0_73) (bvslt v_mkdup_~j~0_73 |mkdup_#in~n|)))) (not (bvule .cse3 .cse0)) (let ((.cse4 (bvadd (bvmul mkdup_~i~0 (_ bv4 32)) mkdup_~a.offset)) (.cse5 (bvadd (bvmul mkdup_~j~0 (_ bv4 32)) mkdup_~a.offset))) (and (or (= .cse4 |mkdup_#in~a.offset|) (= .cse5 |mkdup_#in~a.offset|)) (let ((.cse6 (= |mkdup_#in~a.base| mkdup_~a.base))) (or (and (= .cse4 .cse3) .cse6) (and (= .cse5 .cse3) .cse6))))) (= |mkdup_#in~a.offset| .cse3) (bvslt (_ bv2 32) |mkdup_#in~n|) (not (= (select |#valid| v_prenex_40) (_ bv0 1))) (not (bvult |#StackHeapBarrier| v_prenex_41))))))) --- Real Ultimate output --- This is Ultimate 0.1.24-5758efa [2019-11-26 21:26:07,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 21:26:07,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 21:26:07,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 21:26:07,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 21:26:07,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 21:26:07,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 21:26:07,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 21:26:07,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 21:26:07,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 21:26:07,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 21:26:07,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 21:26:07,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 21:26:07,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 21:26:07,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 21:26:07,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 21:26:07,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 21:26:07,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 21:26:07,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 21:26:07,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 21:26:07,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 21:26:07,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 21:26:07,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 21:26:07,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 21:26:07,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 21:26:07,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 21:26:07,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 21:26:07,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 21:26:07,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 21:26:07,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 21:26:07,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 21:26:07,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 21:26:07,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 21:26:07,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 21:26:07,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 21:26:07,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 21:26:07,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 21:26:07,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 21:26:07,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 21:26:07,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 21:26:07,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 21:26:07,715 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-26 21:26:07,747 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 21:26:07,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 21:26:07,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 21:26:07,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 21:26:07,753 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 21:26:07,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 21:26:07,754 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 21:26:07,754 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 21:26:07,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 21:26:07,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 21:26:07,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 21:26:07,756 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 21:26:07,756 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 21:26:07,757 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 21:26:07,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 21:26:07,757 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 21:26:07,758 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 21:26:07,758 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 21:26:07,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 21:26:07,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 21:26:07,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 21:26:07,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 21:26:07,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:26:07,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 21:26:07,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 21:26:07,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-26 21:26:07,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 21:26:07,761 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-11-26 21:26:08,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 21:26:08,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 21:26:08,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 21:26:08,075 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 21:26:08,075 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 21:26:08,076 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2019-11-26 21:26:08,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c47927c5/80f45f13b03646d6953e271dfba7ecae/FLAGdae98bcca [2019-11-26 21:26:08,595 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 21:26:08,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2019-11-26 21:26:08,602 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c47927c5/80f45f13b03646d6953e271dfba7ecae/FLAGdae98bcca [2019-11-26 21:26:09,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c47927c5/80f45f13b03646d6953e271dfba7ecae [2019-11-26 21:26:09,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 21:26:09,023 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 21:26:09,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 21:26:09,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 21:26:09,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 21:26:09,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:26:09" (1/1) ... [2019-11-26 21:26:09,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cfe08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:26:09, skipping insertion in model container [2019-11-26 21:26:09,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:26:09" (1/1) ... [2019-11-26 21:26:09,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 21:26:09,059 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:26:09,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:26:09,275 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 21:26:09,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:26:09,386 INFO L208 MainTranslator]: Completed translation [2019-11-26 21:26:09,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:26:09 WrapperNode [2019-11-26 21:26:09,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 21:26:09,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 21:26:09,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 21:26:09,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 21:26:09,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:26:09" (1/1) ... [2019-11-26 21:26:09,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:26:09" (1/1) ... [2019-11-26 21:26:09,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:26:09" (1/1) ... [2019-11-26 21:26:09,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:26:09" (1/1) ... [2019-11-26 21:26:09,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:26:09" (1/1) ... [2019-11-26 21:26:09,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:26:09" (1/1) ... [2019-11-26 21:26:09,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:26:09" (1/1) ... [2019-11-26 21:26:09,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 21:26:09,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 21:26:09,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 21:26:09,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 21:26:09,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:26:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-26 21:26:09,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-26 21:26:09,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 21:26:09,501 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-26 21:26:09,501 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-11-26 21:26:09,501 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-11-26 21:26:09,501 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-26 21:26:09,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-26 21:26:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-26 21:26:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-26 21:26:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-26 21:26:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-26 21:26:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-26 21:26:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-26 21:26:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-11-26 21:26:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 21:26:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-11-26 21:26:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 21:26:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-26 21:26:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 21:26:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 21:26:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-26 21:26:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 21:26:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-26 21:26:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 21:26:10,039 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 21:26:10,040 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-26 21:26:10,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:26:10 BoogieIcfgContainer [2019-11-26 21:26:10,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 21:26:10,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 21:26:10,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 21:26:10,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 21:26:10,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 09:26:09" (1/3) ... [2019-11-26 21:26:10,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f613f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:26:10, skipping insertion in model container [2019-11-26 21:26:10,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:26:09" (2/3) ... [2019-11-26 21:26:10,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f613f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:26:10, skipping insertion in model container [2019-11-26 21:26:10,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:26:10" (3/3) ... [2019-11-26 21:26:10,055 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-26 21:26:10,064 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 21:26:10,072 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-11-26 21:26:10,085 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-11-26 21:26:10,106 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 21:26:10,106 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 21:26:10,106 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 21:26:10,106 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 21:26:10,106 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 21:26:10,107 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 21:26:10,107 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 21:26:10,107 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 21:26:10,126 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-26 21:26:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 21:26:10,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:10,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:10,137 INFO L410 AbstractCegarLoop]: === Iteration 1 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:10,143 INFO L82 PathProgramCache]: Analyzing trace with hash 205955921, now seen corresponding path program 1 times [2019-11-26 21:26:10,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:10,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333035462] [2019-11-26 21:26:10,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:10,448 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-26 21:26:10,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333035462] [2019-11-26 21:26:10,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:26:10,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 21:26:10,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892161432] [2019-11-26 21:26:10,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 21:26:10,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:10,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 21:26:10,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-26 21:26:10,475 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 8 states. [2019-11-26 21:26:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:11,198 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-26 21:26:11,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 21:26:11,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-26 21:26:11,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:11,216 INFO L225 Difference]: With dead ends: 105 [2019-11-26 21:26:11,216 INFO L226 Difference]: Without dead ends: 102 [2019-11-26 21:26:11,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-26 21:26:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-26 21:26:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-11-26 21:26:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-26 21:26:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-26 21:26:11,298 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 14 [2019-11-26 21:26:11,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:11,298 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-26 21:26:11,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 21:26:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-26 21:26:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 21:26:11,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:11,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:11,302 INFO L410 AbstractCegarLoop]: === Iteration 2 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:11,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:11,302 INFO L82 PathProgramCache]: Analyzing trace with hash 205955922, now seen corresponding path program 1 times [2019-11-26 21:26:11,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:11,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960224411] [2019-11-26 21:26:11,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:11,572 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-26 21:26:11,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960224411] [2019-11-26 21:26:11,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:26:11,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 21:26:11,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809881316] [2019-11-26 21:26:11,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 21:26:11,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:11,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 21:26:11,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-26 21:26:11,579 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 8 states. [2019-11-26 21:26:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:12,142 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-11-26 21:26:12,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 21:26:12,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-26 21:26:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:12,144 INFO L225 Difference]: With dead ends: 101 [2019-11-26 21:26:12,144 INFO L226 Difference]: Without dead ends: 101 [2019-11-26 21:26:12,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-26 21:26:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-26 21:26:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-11-26 21:26:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-26 21:26:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-11-26 21:26:12,166 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 14 [2019-11-26 21:26:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:12,168 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-11-26 21:26:12,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 21:26:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-11-26 21:26:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 21:26:12,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:12,170 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:12,170 INFO L410 AbstractCegarLoop]: === Iteration 3 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2089666347, now seen corresponding path program 1 times [2019-11-26 21:26:12,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:12,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802028499] [2019-11-26 21:26:12,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:12,356 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-26 21:26:12,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802028499] [2019-11-26 21:26:12,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:26:12,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 21:26:12,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314146313] [2019-11-26 21:26:12,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 21:26:12,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:12,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 21:26:12,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-26 21:26:12,360 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 8 states. [2019-11-26 21:26:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:12,905 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-11-26 21:26:12,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 21:26:12,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-26 21:26:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:12,909 INFO L225 Difference]: With dead ends: 100 [2019-11-26 21:26:12,909 INFO L226 Difference]: Without dead ends: 100 [2019-11-26 21:26:12,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-26 21:26:12,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-26 21:26:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-11-26 21:26:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-26 21:26:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-26 21:26:12,920 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 15 [2019-11-26 21:26:12,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:12,920 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-26 21:26:12,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 21:26:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-26 21:26:12,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 21:26:12,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:12,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:12,922 INFO L410 AbstractCegarLoop]: === Iteration 4 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:12,923 INFO L82 PathProgramCache]: Analyzing trace with hash -905694587, now seen corresponding path program 1 times [2019-11-26 21:26:12,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:12,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226040470] [2019-11-26 21:26:12,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:13,095 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-26 21:26:13,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226040470] [2019-11-26 21:26:13,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:26:13,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 21:26:13,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979819740] [2019-11-26 21:26:13,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 21:26:13,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:13,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 21:26:13,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-26 21:26:13,098 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 8 states. [2019-11-26 21:26:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:13,600 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-26 21:26:13,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 21:26:13,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-26 21:26:13,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:13,602 INFO L225 Difference]: With dead ends: 98 [2019-11-26 21:26:13,602 INFO L226 Difference]: Without dead ends: 98 [2019-11-26 21:26:13,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-26 21:26:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-26 21:26:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-26 21:26:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-26 21:26:13,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-26 21:26:13,611 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 23 [2019-11-26 21:26:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:13,612 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-26 21:26:13,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 21:26:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-26 21:26:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 21:26:13,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:13,613 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:13,614 INFO L410 AbstractCegarLoop]: === Iteration 5 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:13,614 INFO L82 PathProgramCache]: Analyzing trace with hash -905694586, now seen corresponding path program 1 times [2019-11-26 21:26:13,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:13,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444229318] [2019-11-26 21:26:13,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:13,852 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-26 21:26:13,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444229318] [2019-11-26 21:26:13,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:26:13,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 21:26:13,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659318146] [2019-11-26 21:26:13,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 21:26:13,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:13,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 21:26:13,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:26:13,857 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 11 states. [2019-11-26 21:26:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:15,052 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-26 21:26:15,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-26 21:26:15,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-26 21:26:15,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:15,061 INFO L225 Difference]: With dead ends: 118 [2019-11-26 21:26:15,061 INFO L226 Difference]: Without dead ends: 118 [2019-11-26 21:26:15,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-11-26 21:26:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-26 21:26:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2019-11-26 21:26:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-26 21:26:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2019-11-26 21:26:15,070 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 23 [2019-11-26 21:26:15,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:15,071 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2019-11-26 21:26:15,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 21:26:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2019-11-26 21:26:15,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 21:26:15,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:15,072 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:15,072 INFO L410 AbstractCegarLoop]: === Iteration 6 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:15,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:15,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1988238866, now seen corresponding path program 1 times [2019-11-26 21:26:15,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:15,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351856240] [2019-11-26 21:26:15,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:15,294 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-26 21:26:15,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351856240] [2019-11-26 21:26:15,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:26:15,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-26 21:26:15,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112160096] [2019-11-26 21:26:15,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:26:15,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:15,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:26:15,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:26:15,297 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 12 states. [2019-11-26 21:26:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:16,224 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2019-11-26 21:26:16,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-26 21:26:16,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-11-26 21:26:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:16,226 INFO L225 Difference]: With dead ends: 101 [2019-11-26 21:26:16,227 INFO L226 Difference]: Without dead ends: 101 [2019-11-26 21:26:16,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-11-26 21:26:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-26 21:26:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-11-26 21:26:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-26 21:26:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2019-11-26 21:26:16,235 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 24 [2019-11-26 21:26:16,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:16,235 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2019-11-26 21:26:16,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:26:16,236 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2019-11-26 21:26:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 21:26:16,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:16,237 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:16,238 INFO L410 AbstractCegarLoop]: === Iteration 7 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:16,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:16,238 INFO L82 PathProgramCache]: Analyzing trace with hash -562897614, now seen corresponding path program 1 times [2019-11-26 21:26:16,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:16,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555665584] [2019-11-26 21:26:16,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:16,348 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-26 21:26:16,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555665584] [2019-11-26 21:26:16,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:26:16,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 21:26:16,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118833955] [2019-11-26 21:26:16,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 21:26:16,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 21:26:16,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:26:16,352 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 7 states. [2019-11-26 21:26:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:16,745 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2019-11-26 21:26:16,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:26:16,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-26 21:26:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:16,747 INFO L225 Difference]: With dead ends: 96 [2019-11-26 21:26:16,747 INFO L226 Difference]: Without dead ends: 96 [2019-11-26 21:26:16,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:26:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-26 21:26:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-26 21:26:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-26 21:26:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2019-11-26 21:26:16,754 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 26 [2019-11-26 21:26:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:16,754 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2019-11-26 21:26:16,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 21:26:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2019-11-26 21:26:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 21:26:16,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:16,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:16,756 INFO L410 AbstractCegarLoop]: === Iteration 8 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:16,757 INFO L82 PathProgramCache]: Analyzing trace with hash -562897613, now seen corresponding path program 1 times [2019-11-26 21:26:16,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:16,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428670355] [2019-11-26 21:26:16,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:16,876 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-26 21:26:16,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428670355] [2019-11-26 21:26:16,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:26:16,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 21:26:16,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445039772] [2019-11-26 21:26:16,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 21:26:16,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:16,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 21:26:16,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:26:16,879 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 7 states. [2019-11-26 21:26:17,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:17,223 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2019-11-26 21:26:17,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:26:17,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-26 21:26:17,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:17,225 INFO L225 Difference]: With dead ends: 91 [2019-11-26 21:26:17,226 INFO L226 Difference]: Without dead ends: 91 [2019-11-26 21:26:17,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:26:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-26 21:26:17,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2019-11-26 21:26:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-26 21:26:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2019-11-26 21:26:17,232 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 26 [2019-11-26 21:26:17,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:17,232 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2019-11-26 21:26:17,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 21:26:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2019-11-26 21:26:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 21:26:17,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:17,233 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:17,234 INFO L410 AbstractCegarLoop]: === Iteration 9 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash -564101073, now seen corresponding path program 1 times [2019-11-26 21:26:17,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:17,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143252860] [2019-11-26 21:26:17,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:26:17,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143252860] [2019-11-26 21:26:17,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622085514] [2019-11-26 21:26:17,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-26 21:26:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:17,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 21:26:17,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:26:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:26:17,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-26 21:26:17,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 8 [2019-11-26 21:26:17,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089846072] [2019-11-26 21:26:17,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:26:17,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:17,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:26:17,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-26 21:26:17,451 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 5 states. [2019-11-26 21:26:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:17,539 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2019-11-26 21:26:17,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:26:17,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-26 21:26:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:17,545 INFO L225 Difference]: With dead ends: 114 [2019-11-26 21:26:17,548 INFO L226 Difference]: Without dead ends: 114 [2019-11-26 21:26:17,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-26 21:26:17,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-26 21:26:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2019-11-26 21:26:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-26 21:26:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-11-26 21:26:17,557 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 26 [2019-11-26 21:26:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:17,557 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-11-26 21:26:17,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:26:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-11-26 21:26:17,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 21:26:17,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:17,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:17,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:26:17,771 INFO L410 AbstractCegarLoop]: === Iteration 10 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:17,771 INFO L82 PathProgramCache]: Analyzing trace with hash -269956851, now seen corresponding path program 1 times [2019-11-26 21:26:17,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:17,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296158351] [2019-11-26 21:26:17,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:17,869 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-26 21:26:17,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296158351] [2019-11-26 21:26:17,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:26:17,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 21:26:17,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657707149] [2019-11-26 21:26:17,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 21:26:17,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:17,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 21:26:17,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:26:17,872 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 7 states. [2019-11-26 21:26:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:18,228 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-11-26 21:26:18,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:26:18,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-26 21:26:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:18,230 INFO L225 Difference]: With dead ends: 90 [2019-11-26 21:26:18,230 INFO L226 Difference]: Without dead ends: 90 [2019-11-26 21:26:18,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:26:18,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-26 21:26:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-11-26 21:26:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-26 21:26:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-11-26 21:26:18,237 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 27 [2019-11-26 21:26:18,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:18,238 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-11-26 21:26:18,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 21:26:18,238 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-11-26 21:26:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 21:26:18,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:18,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:18,240 INFO L410 AbstractCegarLoop]: === Iteration 11 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:18,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:18,240 INFO L82 PathProgramCache]: Analyzing trace with hash -269956850, now seen corresponding path program 1 times [2019-11-26 21:26:18,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:18,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116534714] [2019-11-26 21:26:18,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:18,317 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-26 21:26:18,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116534714] [2019-11-26 21:26:18,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:26:18,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 21:26:18,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362000174] [2019-11-26 21:26:18,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 21:26:18,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:18,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 21:26:18,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:26:18,320 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 7 states. [2019-11-26 21:26:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:18,631 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-11-26 21:26:18,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:26:18,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-26 21:26:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:18,633 INFO L225 Difference]: With dead ends: 85 [2019-11-26 21:26:18,633 INFO L226 Difference]: Without dead ends: 85 [2019-11-26 21:26:18,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:26:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-26 21:26:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-11-26 21:26:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-26 21:26:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2019-11-26 21:26:18,642 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 27 [2019-11-26 21:26:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:18,642 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2019-11-26 21:26:18,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 21:26:18,643 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2019-11-26 21:26:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-26 21:26:18,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:18,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:18,647 INFO L410 AbstractCegarLoop]: === Iteration 12 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:18,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:18,648 INFO L82 PathProgramCache]: Analyzing trace with hash -800191309, now seen corresponding path program 1 times [2019-11-26 21:26:18,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:18,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312836129] [2019-11-26 21:26:18,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:18,806 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-26 21:26:18,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312836129] [2019-11-26 21:26:18,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:26:18,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 21:26:18,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134785298] [2019-11-26 21:26:18,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 21:26:18,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:18,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 21:26:18,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-26 21:26:18,809 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 10 states. [2019-11-26 21:26:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:19,286 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-11-26 21:26:19,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-26 21:26:19,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-26 21:26:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:19,288 INFO L225 Difference]: With dead ends: 95 [2019-11-26 21:26:19,288 INFO L226 Difference]: Without dead ends: 92 [2019-11-26 21:26:19,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-11-26 21:26:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-26 21:26:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2019-11-26 21:26:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-26 21:26:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2019-11-26 21:26:19,293 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 29 [2019-11-26 21:26:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:19,294 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2019-11-26 21:26:19,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 21:26:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2019-11-26 21:26:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-26 21:26:19,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:19,295 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:19,296 INFO L410 AbstractCegarLoop]: === Iteration 13 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:19,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:19,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2100210528, now seen corresponding path program 1 times [2019-11-26 21:26:19,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:19,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846884430] [2019-11-26 21:26:19,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:26:19,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846884430] [2019-11-26 21:26:19,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291163548] [2019-11-26 21:26:19,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-26 21:26:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:19,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 21:26:19,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:26:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:26:19,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:26:19,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-11-26 21:26:19,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047615916] [2019-11-26 21:26:19,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 21:26:19,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:19,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 21:26:19,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:26:19,543 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 9 states. [2019-11-26 21:26:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:20,014 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2019-11-26 21:26:20,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 21:26:20,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-26 21:26:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:20,016 INFO L225 Difference]: With dead ends: 121 [2019-11-26 21:26:20,016 INFO L226 Difference]: Without dead ends: 121 [2019-11-26 21:26:20,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-11-26 21:26:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-26 21:26:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-11-26 21:26:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-26 21:26:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2019-11-26 21:26:20,026 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 31 [2019-11-26 21:26:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:20,027 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2019-11-26 21:26:20,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 21:26:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2019-11-26 21:26:20,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 21:26:20,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:20,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:20,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:26:20,240 INFO L410 AbstractCegarLoop]: === Iteration 14 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:20,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:20,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1534703516, now seen corresponding path program 1 times [2019-11-26 21:26:20,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:20,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337811327] [2019-11-26 21:26:20,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:20,459 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-26 21:26:20,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337811327] [2019-11-26 21:26:20,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312675803] [2019-11-26 21:26:20,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-26 21:26:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:20,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 21:26:20,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:26:20,615 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-26 21:26:20,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:26:20,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2019-11-26 21:26:20,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712915241] [2019-11-26 21:26:20,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 21:26:20,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:20,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 21:26:20,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-11-26 21:26:20,621 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand 14 states. [2019-11-26 21:26:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:21,383 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2019-11-26 21:26:21,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 21:26:21,384 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-26 21:26:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:21,385 INFO L225 Difference]: With dead ends: 115 [2019-11-26 21:26:21,385 INFO L226 Difference]: Without dead ends: 110 [2019-11-26 21:26:21,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2019-11-26 21:26:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-26 21:26:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2019-11-26 21:26:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-26 21:26:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2019-11-26 21:26:21,390 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 32 [2019-11-26 21:26:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:21,390 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2019-11-26 21:26:21,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 21:26:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2019-11-26 21:26:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 21:26:21,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:21,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:21,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:26:21,596 INFO L410 AbstractCegarLoop]: === Iteration 15 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:21,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:21,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1149138921, now seen corresponding path program 1 times [2019-11-26 21:26:21,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:21,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823674369] [2019-11-26 21:26:21,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:21,677 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-26 21:26:21,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823674369] [2019-11-26 21:26:21,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:26:21,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-26 21:26:21,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689049928] [2019-11-26 21:26:21,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 21:26:21,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 21:26:21,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:26:21,679 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand 9 states. [2019-11-26 21:26:22,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:22,002 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2019-11-26 21:26:22,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 21:26:22,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-26 21:26:22,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:22,005 INFO L225 Difference]: With dead ends: 135 [2019-11-26 21:26:22,006 INFO L226 Difference]: Without dead ends: 135 [2019-11-26 21:26:22,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-26 21:26:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-26 21:26:22,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 104. [2019-11-26 21:26:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-26 21:26:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2019-11-26 21:26:22,020 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 35 [2019-11-26 21:26:22,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:22,021 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2019-11-26 21:26:22,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 21:26:22,021 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2019-11-26 21:26:22,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 21:26:22,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:22,022 INFO L410 BasicCegarLoop]: trace histogram [3, 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-26 21:26:22,022 INFO L410 AbstractCegarLoop]: === Iteration 16 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:22,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:22,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1466392881, now seen corresponding path program 2 times [2019-11-26 21:26:22,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:22,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774652327] [2019-11-26 21:26:22,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:26:22,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774652327] [2019-11-26 21:26:22,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264228809] [2019-11-26 21:26:22,124 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-26 21:26:22,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 21:26:22,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:26:22,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 21:26:22,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:26:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:26:22,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:26:22,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-26 21:26:22,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246814236] [2019-11-26 21:26:22,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-26 21:26:22,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:22,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-26 21:26:22,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-26 21:26:22,356 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 17 states. [2019-11-26 21:26:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:23,437 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2019-11-26 21:26:23,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 21:26:23,437 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-11-26 21:26:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:23,439 INFO L225 Difference]: With dead ends: 131 [2019-11-26 21:26:23,439 INFO L226 Difference]: Without dead ends: 131 [2019-11-26 21:26:23,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2019-11-26 21:26:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-26 21:26:23,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2019-11-26 21:26:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-26 21:26:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2019-11-26 21:26:23,446 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 36 [2019-11-26 21:26:23,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:23,447 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2019-11-26 21:26:23,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-26 21:26:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2019-11-26 21:26:23,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 21:26:23,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:23,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:23,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:26:23,651 INFO L410 AbstractCegarLoop]: === Iteration 17 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:23,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:23,651 INFO L82 PathProgramCache]: Analyzing trace with hash -291785907, now seen corresponding path program 1 times [2019-11-26 21:26:23,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:23,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709599966] [2019-11-26 21:26:23,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:26:23,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709599966] [2019-11-26 21:26:23,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506068562] [2019-11-26 21:26:23,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-26 21:26:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:23,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 21:26:23,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:26:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:26:23,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:26:23,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2019-11-26 21:26:23,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510650741] [2019-11-26 21:26:23,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 21:26:23,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:23,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 21:26:23,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:26:23,808 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 7 states. [2019-11-26 21:26:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:24,102 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-11-26 21:26:24,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:26:24,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-11-26 21:26:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:24,103 INFO L225 Difference]: With dead ends: 93 [2019-11-26 21:26:24,104 INFO L226 Difference]: Without dead ends: 93 [2019-11-26 21:26:24,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:26:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-26 21:26:24,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-11-26 21:26:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-26 21:26:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2019-11-26 21:26:24,109 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 37 [2019-11-26 21:26:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:24,109 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2019-11-26 21:26:24,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 21:26:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2019-11-26 21:26:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-26 21:26:24,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:24,110 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:24,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:26:24,314 INFO L410 AbstractCegarLoop]: === Iteration 18 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:24,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash -909618494, now seen corresponding path program 2 times [2019-11-26 21:26:24,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:24,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474236169] [2019-11-26 21:26:24,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:24,808 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 37 [2019-11-26 21:26:25,025 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 64 [2019-11-26 21:26:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 21:26:25,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474236169] [2019-11-26 21:26:25,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119183224] [2019-11-26 21:26:25,512 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-26 21:26:25,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 21:26:25,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:26:25,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-26 21:26:25,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:26:25,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-26 21:26:25,671 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:26:25,689 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:26:25,691 INFO L508 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-26 21:26:25,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2019-11-26 21:26:25,770 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-26 21:26:25,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-26 21:26:25,771 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:26:25,782 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:26:25,784 INFO L508 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-26 21:26:25,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-11-26 21:26:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 21:26:27,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:26:27,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2019-11-26 21:26:27,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157251025] [2019-11-26 21:26:27,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-26 21:26:27,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:27,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-26 21:26:27,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-11-26 21:26:27,152 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 29 states. [2019-11-26 21:26:28,259 WARN L192 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-11-26 21:26:28,798 WARN L192 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-26 21:26:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:37,423 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2019-11-26 21:26:37,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-26 21:26:37,424 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2019-11-26 21:26:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:37,426 INFO L225 Difference]: With dead ends: 156 [2019-11-26 21:26:37,426 INFO L226 Difference]: Without dead ends: 148 [2019-11-26 21:26:37,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=234, Invalid=1836, Unknown=0, NotChecked=0, Total=2070 [2019-11-26 21:26:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-26 21:26:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2019-11-26 21:26:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-26 21:26:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-11-26 21:26:37,432 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 40 [2019-11-26 21:26:37,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:37,433 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-11-26 21:26:37,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-26 21:26:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-11-26 21:26:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-26 21:26:37,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:37,434 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:37,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:26:37,638 INFO L410 AbstractCegarLoop]: === Iteration 19 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:37,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:37,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1547438402, now seen corresponding path program 1 times [2019-11-26 21:26:37,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:37,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075330477] [2019-11-26 21:26:37,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:26:37,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075330477] [2019-11-26 21:26:37,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:26:37,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-26 21:26:37,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826034148] [2019-11-26 21:26:37,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 21:26:37,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:37,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 21:26:37,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-26 21:26:37,849 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 15 states. [2019-11-26 21:26:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:38,697 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2019-11-26 21:26:38,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 21:26:38,698 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2019-11-26 21:26:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:38,700 INFO L225 Difference]: With dead ends: 140 [2019-11-26 21:26:38,700 INFO L226 Difference]: Without dead ends: 140 [2019-11-26 21:26:38,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-11-26 21:26:38,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-26 21:26:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2019-11-26 21:26:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-26 21:26:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-11-26 21:26:38,707 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 43 [2019-11-26 21:26:38,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:38,707 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-11-26 21:26:38,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 21:26:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-11-26 21:26:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 21:26:38,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:38,709 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:26:38,709 INFO L410 AbstractCegarLoop]: === Iteration 20 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1715645055, now seen corresponding path program 1 times [2019-11-26 21:26:38,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:38,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521900205] [2019-11-26 21:26:38,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:26:39,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521900205] [2019-11-26 21:26:39,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336768984] [2019-11-26 21:26:39,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-26 21:26:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:39,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-26 21:26:39,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:26:39,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-26 21:26:39,440 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:26:39,447 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:26:39,447 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:26:39,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-26 21:26:39,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 21:26:39,587 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:26:39,595 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:26:39,596 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:26:39,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-11-26 21:26:39,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:26:39,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2019-11-26 21:26:39,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:26:39,671 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:26:39,699 INFO L588 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-26 21:26:39,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:26:39,701 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 21:26:39,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:31 [2019-11-26 21:26:39,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:26:39,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:26:39,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:26:39,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:26:40,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-26 21:26:40,062 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:26:40,083 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:26:40,083 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:26:40,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:12 [2019-11-26 21:26:40,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:26:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:26:40,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:26:40,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 35 [2019-11-26 21:26:40,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041222758] [2019-11-26 21:26:40,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-26 21:26:40,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:40,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-26 21:26:40,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2019-11-26 21:26:40,219 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 35 states. [2019-11-26 21:26:45,261 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-26 21:26:47,457 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-11-26 21:26:47,674 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-11-26 21:26:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:26:50,192 INFO L93 Difference]: Finished difference Result 183 states and 206 transitions. [2019-11-26 21:26:50,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-26 21:26:50,193 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2019-11-26 21:26:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:26:50,194 INFO L225 Difference]: With dead ends: 183 [2019-11-26 21:26:50,194 INFO L226 Difference]: Without dead ends: 183 [2019-11-26 21:26:50,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=463, Invalid=3959, Unknown=0, NotChecked=0, Total=4422 [2019-11-26 21:26:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-26 21:26:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2019-11-26 21:26:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 21:26:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2019-11-26 21:26:50,205 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 45 [2019-11-26 21:26:50,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:26:50,205 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2019-11-26 21:26:50,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-26 21:26:50,205 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2019-11-26 21:26:50,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 21:26:50,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:26:50,206 INFO L410 BasicCegarLoop]: trace histogram [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-26 21:26:50,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:26:50,415 INFO L410 AbstractCegarLoop]: === Iteration 21 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:26:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:26:50,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1209011571, now seen corresponding path program 3 times [2019-11-26 21:26:50,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:26:50,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738746127] [2019-11-26 21:26:50,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:26:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:26:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:26:50,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738746127] [2019-11-26 21:26:50,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991757512] [2019-11-26 21:26:50,490 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-26 21:26:50,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-26 21:26:50,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:26:50,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-26 21:26:50,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:26:50,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-26 21:26:50,570 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:26:50,580 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:26:50,580 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:26:50,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-26 21:26:50,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-26 21:26:50,758 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:26:50,788 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:26:50,790 INFO L508 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-26 21:26:50,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:68 [2019-11-26 21:26:50,864 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-26 21:26:50,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-26 21:26:50,866 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:26:50,907 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:26:50,908 INFO L508 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-26 21:26:50,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:70 [2019-11-26 21:26:51,175 INFO L404 ElimStorePlain]: Different costs {2=[|v_#length_41|], 4=[|v_#valid_52|]} [2019-11-26 21:26:51,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:26:51,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:26:51,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:26:51,197 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-11-26 21:26:51,197 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:26:51,234 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:26:51,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:26:51,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:26:51,250 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:26:51,250 INFO L377 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 20 treesize of output 22 [2019-11-26 21:26:51,250 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:26:51,279 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:26:51,281 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-26 21:26:51,281 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:67 [2019-11-26 21:26:51,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:26:51,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2019-11-26 21:26:51,363 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:26:51,398 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:26:51,401 INFO L508 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-26 21:26:51,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:87, output treesize:51 [2019-11-26 21:26:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 21:26:52,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:26:52,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20] total 27 [2019-11-26 21:26:52,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314753544] [2019-11-26 21:26:52,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-26 21:26:52,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:26:52,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-26 21:26:52,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2019-11-26 21:26:52,464 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 27 states. [2019-11-26 21:26:53,191 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-11-26 21:26:53,417 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-11-26 21:26:55,088 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2019-11-26 21:27:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:27:31,056 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2019-11-26 21:27:31,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-11-26 21:27:31,056 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2019-11-26 21:27:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:27:31,058 INFO L225 Difference]: With dead ends: 197 [2019-11-26 21:27:31,058 INFO L226 Difference]: Without dead ends: 197 [2019-11-26 21:27:31,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=833, Invalid=3983, Unknown=14, NotChecked=0, Total=4830 [2019-11-26 21:27:31,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-26 21:27:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 145. [2019-11-26 21:27:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 21:27:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2019-11-26 21:27:31,068 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 45 [2019-11-26 21:27:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:27:31,068 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2019-11-26 21:27:31,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-26 21:27:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2019-11-26 21:27:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 21:27:31,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:27:31,070 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:27:31,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:27:31,273 INFO L410 AbstractCegarLoop]: === Iteration 22 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:27:31,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:27:31,275 INFO L82 PathProgramCache]: Analyzing trace with hash 936948074, now seen corresponding path program 1 times [2019-11-26 21:27:31,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:27:31,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208868261] [2019-11-26 21:27:31,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:27:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 21:27:31,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208868261] [2019-11-26 21:27:31,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:27:31,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-26 21:27:31,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126318389] [2019-11-26 21:27:31,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:27:31,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:27:31,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:27:31,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:27:31,417 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand 12 states. [2019-11-26 21:27:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:27:32,073 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2019-11-26 21:27:32,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-26 21:27:32,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-26 21:27:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:27:32,077 INFO L225 Difference]: With dead ends: 151 [2019-11-26 21:27:32,077 INFO L226 Difference]: Without dead ends: 151 [2019-11-26 21:27:32,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-11-26 21:27:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-26 21:27:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2019-11-26 21:27:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 21:27:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2019-11-26 21:27:32,084 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 54 [2019-11-26 21:27:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:27:32,085 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2019-11-26 21:27:32,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:27:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2019-11-26 21:27:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 21:27:32,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:27:32,086 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-26 21:27:32,086 INFO L410 AbstractCegarLoop]: === Iteration 23 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:27:32,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:27:32,087 INFO L82 PathProgramCache]: Analyzing trace with hash -21831271, now seen corresponding path program 4 times [2019-11-26 21:27:32,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:27:32,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123961047] [2019-11-26 21:27:32,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:27:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:32,178 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1315) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1196) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:573) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:171) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 21:27:32,184 INFO L168 Benchmark]: Toolchain (without parser) took 83161.38 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 447.7 MB). Free memory was 963.1 MB in the beginning and 909.3 MB in the end (delta: 53.7 MB). Peak memory consumption was 501.5 MB. Max. memory is 11.5 GB. [2019-11-26 21:27:32,184 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:27:32,185 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 963.1 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-26 21:27:32,185 INFO L168 Benchmark]: Boogie Preprocessor took 58.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-26 21:27:32,185 INFO L168 Benchmark]: RCFGBuilder took 596.24 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2019-11-26 21:27:32,186 INFO L168 Benchmark]: TraceAbstraction took 82138.34 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 298.3 MB). Free memory was 1.1 GB in the beginning and 909.3 MB in the end (delta: 196.7 MB). Peak memory consumption was 495.0 MB. Max. memory is 11.5 GB. [2019-11-26 21:27:32,188 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.62 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 963.1 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 596.24 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 82138.34 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 298.3 MB). Free memory was 1.1 GB in the beginning and 909.3 MB in the end (delta: 196.7 MB). Peak memory consumption was 495.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-5758efa [2019-11-26 21:27:34,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 21:27:34,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 21:27:34,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 21:27:34,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 21:27:34,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 21:27:34,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 21:27:34,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 21:27:34,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 21:27:34,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 21:27:34,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 21:27:34,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 21:27:34,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 21:27:34,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 21:27:34,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 21:27:34,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 21:27:34,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 21:27:34,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 21:27:34,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 21:27:34,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 21:27:34,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 21:27:34,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 21:27:34,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 21:27:34,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 21:27:34,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 21:27:34,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 21:27:34,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 21:27:34,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 21:27:34,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 21:27:34,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 21:27:34,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 21:27:34,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 21:27:34,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 21:27:34,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 21:27:34,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 21:27:34,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 21:27:34,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 21:27:34,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 21:27:34,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 21:27:34,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 21:27:34,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 21:27:34,259 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-26 21:27:34,274 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 21:27:34,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 21:27:34,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 21:27:34,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 21:27:34,276 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 21:27:34,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 21:27:34,277 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 21:27:34,277 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 21:27:34,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 21:27:34,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 21:27:34,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 21:27:34,278 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 21:27:34,278 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 21:27:34,278 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 21:27:34,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 21:27:34,278 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 21:27:34,279 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 21:27:34,279 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 21:27:34,279 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 21:27:34,279 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 21:27:34,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 21:27:34,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 21:27:34,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 21:27:34,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 21:27:34,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:27:34,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 21:27:34,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 21:27:34,281 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-26 21:27:34,281 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 21:27:34,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 21:27:34,282 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-11-26 21:27:34,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 21:27:34,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 21:27:34,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 21:27:34,591 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 21:27:34,592 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 21:27:34,593 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2019-11-26 21:27:34,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ec1fcda/6f869dd6f6674446bdded71a37a258de/FLAGb9d332ae9 [2019-11-26 21:27:35,116 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 21:27:35,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2019-11-26 21:27:35,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ec1fcda/6f869dd6f6674446bdded71a37a258de/FLAGb9d332ae9 [2019-11-26 21:27:35,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ec1fcda/6f869dd6f6674446bdded71a37a258de [2019-11-26 21:27:35,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 21:27:35,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 21:27:35,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 21:27:35,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 21:27:35,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 21:27:35,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:27:35" (1/1) ... [2019-11-26 21:27:35,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e4995b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:27:35, skipping insertion in model container [2019-11-26 21:27:35,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:27:35" (1/1) ... [2019-11-26 21:27:35,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 21:27:35,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:27:35,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:27:35,749 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 21:27:35,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:27:35,857 INFO L208 MainTranslator]: Completed translation [2019-11-26 21:27:35,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:27:35 WrapperNode [2019-11-26 21:27:35,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 21:27:35,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 21:27:35,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 21:27:35,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 21:27:35,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:27:35" (1/1) ... [2019-11-26 21:27:35,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:27:35" (1/1) ... [2019-11-26 21:27:35,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:27:35" (1/1) ... [2019-11-26 21:27:35,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:27:35" (1/1) ... [2019-11-26 21:27:35,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:27:35" (1/1) ... [2019-11-26 21:27:35,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:27:35" (1/1) ... [2019-11-26 21:27:35,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:27:35" (1/1) ... [2019-11-26 21:27:35,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 21:27:35,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 21:27:35,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 21:27:35,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 21:27:35,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:27:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-26 21:27:35,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-26 21:27:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 21:27:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-26 21:27:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-11-26 21:27:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-11-26 21:27:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-26 21:27:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-26 21:27:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-26 21:27:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-26 21:27:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-26 21:27:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-26 21:27:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-26 21:27:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-26 21:27:35,975 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-11-26 21:27:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 21:27:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-11-26 21:27:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 21:27:35,976 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-26 21:27:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 21:27:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 21:27:35,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-26 21:27:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 21:27:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-26 21:27:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 21:27:36,667 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 21:27:36,667 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-26 21:27:36,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:27:36 BoogieIcfgContainer [2019-11-26 21:27:36,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 21:27:36,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 21:27:36,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 21:27:36,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 21:27:36,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 09:27:35" (1/3) ... [2019-11-26 21:27:36,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6523fe2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:27:36, skipping insertion in model container [2019-11-26 21:27:36,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:27:35" (2/3) ... [2019-11-26 21:27:36,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6523fe2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:27:36, skipping insertion in model container [2019-11-26 21:27:36,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:27:36" (3/3) ... [2019-11-26 21:27:36,675 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-26 21:27:36,684 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 21:27:36,689 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-11-26 21:27:36,701 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-11-26 21:27:36,717 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 21:27:36,718 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 21:27:36,718 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 21:27:36,718 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 21:27:36,718 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 21:27:36,718 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 21:27:36,719 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 21:27:36,719 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 21:27:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-26 21:27:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 21:27:36,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:27:36,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:27:36,750 INFO L410 AbstractCegarLoop]: === Iteration 1 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:27:36,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:27:36,756 INFO L82 PathProgramCache]: Analyzing trace with hash 205955921, now seen corresponding path program 1 times [2019-11-26 21:27:36,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:27:36,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415674716] [2019-11-26 21:27:36,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-26 21:27:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:36,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:27:36,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:27:36,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:27:36,953 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:27:36,961 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:27:36,961 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:27:36,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:27:37,048 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-26 21:27:37,048 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:27:37,078 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-26 21:27:37,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415674716] [2019-11-26 21:27:37,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:27:37,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 6 [2019-11-26 21:27:37,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635788377] [2019-11-26 21:27:37,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 21:27:37,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:27:37,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 21:27:37,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:27:37,106 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 7 states. [2019-11-26 21:27:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:27:37,672 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2019-11-26 21:27:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 21:27:37,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-26 21:27:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:27:37,685 INFO L225 Difference]: With dead ends: 103 [2019-11-26 21:27:37,685 INFO L226 Difference]: Without dead ends: 100 [2019-11-26 21:27:37,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:27:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-26 21:27:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-26 21:27:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-26 21:27:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-26 21:27:37,741 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 14 [2019-11-26 21:27:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:27:37,741 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-26 21:27:37,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 21:27:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-26 21:27:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 21:27:37,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:27:37,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:27:37,955 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-26 21:27:37,956 INFO L410 AbstractCegarLoop]: === Iteration 2 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:27:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:27:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash 205955922, now seen corresponding path program 1 times [2019-11-26 21:27:37,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:27:37,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267793896] [2019-11-26 21:27:37,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-26 21:27:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:38,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-26 21:27:38,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:27:38,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-26 21:27:38,062 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:27:38,078 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:27:38,078 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:27:38,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-26 21:27:38,399 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-26 21:27:38,400 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:27:40,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:27:41,161 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-26 21:27:41,685 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-26 21:27:41,920 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-26 21:27:41,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267793896] [2019-11-26 21:27:41,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:27:41,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-26 21:27:41,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481867931] [2019-11-26 21:27:41,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 21:27:41,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:27:41,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 21:27:41,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2019-11-26 21:27:41,925 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2019-11-26 21:27:44,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:27:44,205 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-26 21:27:44,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 21:27:44,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-11-26 21:27:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:27:44,209 INFO L225 Difference]: With dead ends: 99 [2019-11-26 21:27:44,209 INFO L226 Difference]: Without dead ends: 99 [2019-11-26 21:27:44,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=41, Invalid=114, Unknown=1, NotChecked=0, Total=156 [2019-11-26 21:27:44,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-26 21:27:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-11-26 21:27:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-26 21:27:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-11-26 21:27:44,223 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 14 [2019-11-26 21:27:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:27:44,224 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-11-26 21:27:44,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 21:27:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-11-26 21:27:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 21:27:44,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:27:44,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:27:44,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-26 21:27:44,429 INFO L410 AbstractCegarLoop]: === Iteration 3 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:27:44,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:27:44,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2089666347, now seen corresponding path program 1 times [2019-11-26 21:27:44,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:27:44,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542591419] [2019-11-26 21:27:44,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-26 21:27:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:44,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 21:27:44,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:27:44,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-26 21:27:44,523 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:27:44,541 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:27:44,541 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:27:44,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-26 21:27:44,705 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-26 21:27:44,705 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:27:44,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:27:45,413 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2019-11-26 21:27:45,762 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-26 21:27:48,008 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-26 21:27:48,039 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-26 21:27:48,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542591419] [2019-11-26 21:27:48,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:27:48,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-26 21:27:48,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333971823] [2019-11-26 21:27:48,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 21:27:48,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:27:48,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 21:27:48,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2019-11-26 21:27:48,041 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 11 states. [2019-11-26 21:27:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:27:50,653 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-26 21:27:50,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 21:27:50,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-11-26 21:27:50,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:27:50,656 INFO L225 Difference]: With dead ends: 98 [2019-11-26 21:27:50,656 INFO L226 Difference]: Without dead ends: 98 [2019-11-26 21:27:50,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=41, Invalid=114, Unknown=1, NotChecked=0, Total=156 [2019-11-26 21:27:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-26 21:27:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-26 21:27:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-26 21:27:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-26 21:27:50,666 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 15 [2019-11-26 21:27:50,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:27:50,667 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-26 21:27:50,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 21:27:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-26 21:27:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 21:27:50,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:27:50,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:27:50,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-26 21:27:50,873 INFO L410 AbstractCegarLoop]: === Iteration 4 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:27:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:27:50,874 INFO L82 PathProgramCache]: Analyzing trace with hash -905694587, now seen corresponding path program 1 times [2019-11-26 21:27:50,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:27:50,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031925895] [2019-11-26 21:27:50,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-26 21:27:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:50,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 21:27:50,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:27:50,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:27:50,992 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:27:50,994 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:27:50,995 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:27:50,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:27:51,170 INFO L343 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2019-11-26 21:27:51,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 49 [2019-11-26 21:27:51,171 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:27:51,204 INFO L588 ElimStorePlain]: treesize reduction 17, result has 54.1 percent of original size [2019-11-26 21:27:51,205 INFO L508 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-26 21:27:51,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2019-11-26 21:27:51,286 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-26 21:27:51,287 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:27:51,448 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-26 21:27:51,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031925895] [2019-11-26 21:27:51,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:27:51,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-26 21:27:51,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104647031] [2019-11-26 21:27:51,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:27:51,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:27:51,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:27:51,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:27:51,451 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 12 states. [2019-11-26 21:27:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:27:52,104 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-26 21:27:52,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 21:27:52,105 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-26 21:27:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:27:52,107 INFO L225 Difference]: With dead ends: 96 [2019-11-26 21:27:52,107 INFO L226 Difference]: Without dead ends: 96 [2019-11-26 21:27:52,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-26 21:27:52,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-26 21:27:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-11-26 21:27:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-26 21:27:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-26 21:27:52,117 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 23 [2019-11-26 21:27:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:27:52,117 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-26 21:27:52,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:27:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-26 21:27:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 21:27:52,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:27:52,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:27:52,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-26 21:27:52,322 INFO L410 AbstractCegarLoop]: === Iteration 5 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:27:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:27:52,322 INFO L82 PathProgramCache]: Analyzing trace with hash -905694586, now seen corresponding path program 1 times [2019-11-26 21:27:52,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:27:52,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975551857] [2019-11-26 21:27:52,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-26 21:27:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:52,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-26 21:27:52,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:27:52,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:27:52,411 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:27:52,426 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:27:52,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-26 21:27:52,436 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:27:52,452 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:27:52,452 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:27:52,453 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-11-26 21:27:52,716 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_72|], 2=[|v_#length_48|]} [2019-11-26 21:27:52,731 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:27:52,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-26 21:27:52,732 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:27:52,787 INFO L588 ElimStorePlain]: treesize reduction 3, result has 91.7 percent of original size [2019-11-26 21:27:52,860 INFO L343 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2019-11-26 21:27:52,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 35 [2019-11-26 21:27:52,861 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:27:52,932 INFO L588 ElimStorePlain]: treesize reduction 10, result has 79.2 percent of original size [2019-11-26 21:27:52,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:27:52,936 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-26 21:27:52,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:38 [2019-11-26 21:27:52,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:27:52,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:27:53,127 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-26 21:27:53,127 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:27:53,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:27:53,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:27:53,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:27:53,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:27:53,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:27:53,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:27:53,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:27:53,793 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 28 [2019-11-26 21:27:54,547 WARN L192 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 30 [2019-11-26 21:27:55,274 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-26 21:27:55,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975551857] [2019-11-26 21:27:55,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:27:55,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2019-11-26 21:27:55,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198585161] [2019-11-26 21:27:55,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-26 21:27:55,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:27:55,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-26 21:27:55,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-11-26 21:27:55,278 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 17 states. [2019-11-26 21:27:56,003 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-26 21:27:57,222 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-26 21:27:59,448 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-26 21:27:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:27:59,511 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-26 21:27:59,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 21:27:59,512 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-11-26 21:27:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:27:59,515 INFO L225 Difference]: With dead ends: 118 [2019-11-26 21:27:59,515 INFO L226 Difference]: Without dead ends: 118 [2019-11-26 21:27:59,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-11-26 21:27:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-26 21:27:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2019-11-26 21:27:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-26 21:27:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2019-11-26 21:27:59,525 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 23 [2019-11-26 21:27:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:27:59,526 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2019-11-26 21:27:59,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-26 21:27:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2019-11-26 21:27:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 21:27:59,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:27:59,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:27:59,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-26 21:27:59,741 INFO L410 AbstractCegarLoop]: === Iteration 6 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:27:59,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:27:59,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1988238866, now seen corresponding path program 1 times [2019-11-26 21:27:59,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:27:59,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103517422] [2019-11-26 21:27:59,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-26 21:27:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:27:59,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-26 21:27:59,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:27:59,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-26 21:27:59,833 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:27:59,852 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:27:59,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:27:59,859 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:27:59,878 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:27:59,878 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:27:59,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2019-11-26 21:28:00,099 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_79|], 2=[|v_#length_52|]} [2019-11-26 21:28:00,112 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:28:00,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-26 21:28:00,114 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:28:00,146 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:28:00,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:28:00,175 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 21:28:00,175 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-26 21:28:00,176 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:28:00,211 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:28:00,212 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-26 21:28:00,212 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:37 [2019-11-26 21:28:00,695 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-26 21:28:00,696 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:28:01,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:28:05,864 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-26 21:28:05,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103517422] [2019-11-26 21:28:05,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:28:05,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 18 [2019-11-26 21:28:05,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198235148] [2019-11-26 21:28:05,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-26 21:28:05,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:28:05,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-26 21:28:05,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-11-26 21:28:05,867 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 19 states. [2019-11-26 21:28:07,553 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-26 21:28:07,870 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-26 21:28:08,128 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-26 21:28:08,713 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-26 21:28:09,482 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-26 21:28:10,644 WARN L192 SmtUtils]: Spent 496.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-26 21:28:11,245 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-26 21:28:12,030 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-26 21:28:12,400 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-26 21:28:12,806 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-26 21:28:13,580 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-26 21:28:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:28:16,889 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2019-11-26 21:28:16,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 21:28:16,890 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-11-26 21:28:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:28:16,892 INFO L225 Difference]: With dead ends: 164 [2019-11-26 21:28:16,892 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 21:28:16,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2019-11-26 21:28:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 21:28:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 115. [2019-11-26 21:28:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 21:28:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2019-11-26 21:28:16,904 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 24 [2019-11-26 21:28:16,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:28:16,904 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2019-11-26 21:28:16,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-26 21:28:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2019-11-26 21:28:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 21:28:16,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:28:16,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:28:17,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-26 21:28:17,117 INFO L410 AbstractCegarLoop]: === Iteration 7 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:28:17,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:28:17,118 INFO L82 PathProgramCache]: Analyzing trace with hash -562897614, now seen corresponding path program 1 times [2019-11-26 21:28:17,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:28:17,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614598595] [2019-11-26 21:28:17,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-26 21:28:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:28:17,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:28:17,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:28:17,248 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 21:28:17,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-11-26 21:28:17,249 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:28:17,258 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:28:17,259 INFO L508 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-26 21:28:17,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-26 21:28:17,318 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-26 21:28:17,319 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:28:17,365 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-26 21:28:17,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614598595] [2019-11-26 21:28:17,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:28:17,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-26 21:28:17,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480660579] [2019-11-26 21:28:17,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 21:28:17,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:28:17,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 21:28:17,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 21:28:17,369 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand 8 states. [2019-11-26 21:28:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:28:17,817 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-11-26 21:28:17,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:28:17,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-26 21:28:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:28:17,819 INFO L225 Difference]: With dead ends: 110 [2019-11-26 21:28:17,819 INFO L226 Difference]: Without dead ends: 110 [2019-11-26 21:28:17,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:28:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-26 21:28:17,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-11-26 21:28:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-26 21:28:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2019-11-26 21:28:17,826 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 26 [2019-11-26 21:28:17,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:28:17,826 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2019-11-26 21:28:17,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 21:28:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2019-11-26 21:28:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 21:28:17,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:28:17,828 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:28:18,035 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-26 21:28:18,036 INFO L410 AbstractCegarLoop]: === Iteration 8 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:28:18,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:28:18,036 INFO L82 PathProgramCache]: Analyzing trace with hash -562897613, now seen corresponding path program 1 times [2019-11-26 21:28:18,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:28:18,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809712801] [2019-11-26 21:28:18,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-26 21:28:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:28:18,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 21:28:18,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:28:18,166 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_56|], 1=[|v_#valid_90|]} [2019-11-26 21:28:18,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:28:18,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 21:28:18,174 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:28:18,187 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:28:18,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-26 21:28:18,194 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:28:18,213 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:28:18,214 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 21:28:18,214 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-11-26 21:28:18,284 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-26 21:28:18,285 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:28:18,425 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-26 21:28:18,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809712801] [2019-11-26 21:28:18,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:28:18,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-26 21:28:18,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050204228] [2019-11-26 21:28:18,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 21:28:18,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:28:18,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 21:28:18,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 21:28:18,428 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand 8 states. [2019-11-26 21:28:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:28:19,074 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2019-11-26 21:28:19,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:28:19,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-26 21:28:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:28:19,076 INFO L225 Difference]: With dead ends: 105 [2019-11-26 21:28:19,076 INFO L226 Difference]: Without dead ends: 105 [2019-11-26 21:28:19,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:28:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-26 21:28:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-11-26 21:28:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-26 21:28:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-11-26 21:28:19,082 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 26 [2019-11-26 21:28:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:28:19,082 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-11-26 21:28:19,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 21:28:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2019-11-26 21:28:19,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 21:28:19,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:28:19,083 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:28:19,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-26 21:28:19,288 INFO L410 AbstractCegarLoop]: === Iteration 9 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:28:19,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:28:19,288 INFO L82 PathProgramCache]: Analyzing trace with hash -564101073, now seen corresponding path program 1 times [2019-11-26 21:28:19,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:28:19,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292819562] [2019-11-26 21:28:19,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-26 21:28:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:28:19,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 21:28:19,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:28:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:28:19,525 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:28:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:28:19,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292819562] [2019-11-26 21:28:19,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:28:19,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-26 21:28:19,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263612423] [2019-11-26 21:28:19,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-26 21:28:19,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:28:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-26 21:28:19,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-26 21:28:19,721 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 13 states. [2019-11-26 21:28:20,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:28:20,398 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2019-11-26 21:28:20,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 21:28:20,401 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-11-26 21:28:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:28:20,403 INFO L225 Difference]: With dead ends: 122 [2019-11-26 21:28:20,403 INFO L226 Difference]: Without dead ends: 122 [2019-11-26 21:28:20,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-26 21:28:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-26 21:28:20,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2019-11-26 21:28:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-26 21:28:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2019-11-26 21:28:20,408 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 26 [2019-11-26 21:28:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:28:20,409 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2019-11-26 21:28:20,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-26 21:28:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2019-11-26 21:28:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 21:28:20,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:28:20,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:28:20,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-26 21:28:20,618 INFO L410 AbstractCegarLoop]: === Iteration 10 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:28:20,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:28:20,618 INFO L82 PathProgramCache]: Analyzing trace with hash -269956851, now seen corresponding path program 1 times [2019-11-26 21:28:20,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:28:20,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148841416] [2019-11-26 21:28:20,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-26 21:28:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:28:20,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 21:28:20,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:28:20,704 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 21:28:20,704 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 21:28:20,704 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:28:20,714 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:28:20,714 INFO L508 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-26 21:28:20,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-26 21:28:20,741 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-26 21:28:20,741 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:28:20,756 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-26 21:28:20,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148841416] [2019-11-26 21:28:20,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:28:20,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 21:28:20,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852435765] [2019-11-26 21:28:20,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:28:20,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:28:20,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:28:20,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:28:20,758 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 5 states. [2019-11-26 21:28:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:28:20,984 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2019-11-26 21:28:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:28:20,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-26 21:28:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:28:20,987 INFO L225 Difference]: With dead ends: 100 [2019-11-26 21:28:20,987 INFO L226 Difference]: Without dead ends: 100 [2019-11-26 21:28:20,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 21:28:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-26 21:28:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-26 21:28:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-26 21:28:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2019-11-26 21:28:20,992 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 27 [2019-11-26 21:28:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:28:20,993 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2019-11-26 21:28:20,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:28:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2019-11-26 21:28:20,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 21:28:20,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:28:20,994 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:28:21,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-26 21:28:21,198 INFO L410 AbstractCegarLoop]: === Iteration 11 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:28:21,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:28:21,198 INFO L82 PathProgramCache]: Analyzing trace with hash -269956850, now seen corresponding path program 1 times [2019-11-26 21:28:21,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:28:21,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190539072] [2019-11-26 21:28:21,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-26 21:28:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:28:21,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 21:28:21,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:28:21,277 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 21:28:21,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 21:28:21,278 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:28:21,285 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:28:21,286 INFO L508 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-26 21:28:21,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-26 21:28:21,328 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-26 21:28:21,329 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:28:21,450 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-26 21:28:21,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190539072] [2019-11-26 21:28:21,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:28:21,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-26 21:28:21,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272867010] [2019-11-26 21:28:21,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 21:28:21,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:28:21,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 21:28:21,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 21:28:21,452 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand 8 states. [2019-11-26 21:28:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:28:21,969 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2019-11-26 21:28:21,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:28:21,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-26 21:28:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:28:21,974 INFO L225 Difference]: With dead ends: 95 [2019-11-26 21:28:21,974 INFO L226 Difference]: Without dead ends: 95 [2019-11-26 21:28:21,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:28:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-26 21:28:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-11-26 21:28:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-26 21:28:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2019-11-26 21:28:21,978 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 27 [2019-11-26 21:28:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:28:21,979 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2019-11-26 21:28:21,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 21:28:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2019-11-26 21:28:21,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-26 21:28:21,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:28:21,980 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:28:22,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-26 21:28:22,190 INFO L410 AbstractCegarLoop]: === Iteration 12 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:28:22,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:28:22,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2100210528, now seen corresponding path program 1 times [2019-11-26 21:28:22,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:28:22,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061856548] [2019-11-26 21:28:22,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-26 21:28:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:28:22,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 21:28:22,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:28:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:28:22,364 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:28:22,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:28:22,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2019-11-26 21:28:22,624 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 21:28:22,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-11-26 21:28:22,636 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 21:28:22,713 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:28:22,714 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-26 21:28:22,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:42 [2019-11-26 21:28:22,967 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-11-26 21:28:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:28:23,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061856548] [2019-11-26 21:28:23,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:28:23,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-26 21:28:23,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803365984] [2019-11-26 21:28:23,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 21:28:23,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:28:23,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 21:28:23,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-26 21:28:23,272 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand 16 states. [2019-11-26 21:28:25,522 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-11-26 21:28:26,344 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-11-26 21:28:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:28:27,245 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2019-11-26 21:28:27,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 21:28:27,246 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-26 21:28:27,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:28:27,249 INFO L225 Difference]: With dead ends: 180 [2019-11-26 21:28:27,249 INFO L226 Difference]: Without dead ends: 180 [2019-11-26 21:28:27,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2019-11-26 21:28:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-26 21:28:27,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 114. [2019-11-26 21:28:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-26 21:28:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 142 transitions. [2019-11-26 21:28:27,257 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 142 transitions. Word has length 31 [2019-11-26 21:28:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:28:27,258 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 142 transitions. [2019-11-26 21:28:27,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 21:28:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 142 transitions. [2019-11-26 21:28:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 21:28:27,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:28:27,259 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:28:27,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-26 21:28:27,472 INFO L410 AbstractCegarLoop]: === Iteration 13 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:28:27,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:28:27,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1083087694, now seen corresponding path program 1 times [2019-11-26 21:28:27,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:28:27,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682607647] [2019-11-26 21:28:27,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-26 21:28:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:28:27,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 21:28:27,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:28:27,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-26 21:28:27,590 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:28:27,606 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:28:27,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:28:27,612 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:28:27,630 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:28:27,631 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:28:27,631 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-11-26 21:28:27,832 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_114|], 2=[|v_#length_65|]} [2019-11-26 21:28:27,844 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:28:27,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-26 21:28:27,845 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:28:27,869 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:28:27,924 INFO L343 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2019-11-26 21:28:27,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 35 [2019-11-26 21:28:27,925 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:28:27,983 INFO L588 ElimStorePlain]: treesize reduction 10, result has 77.8 percent of original size [2019-11-26 21:28:27,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:28:27,985 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-26 21:28:27,986 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:35 [2019-11-26 21:28:27,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:28:28,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:28:28,202 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-11-26 21:28:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:28:28,972 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:28:30,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:28:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:28:32,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682607647] [2019-11-26 21:28:32,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:28:32,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2019-11-26 21:28:32,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678220964] [2019-11-26 21:28:32,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-26 21:28:32,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:28:32,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-26 21:28:32,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-11-26 21:28:32,283 INFO L87 Difference]: Start difference. First operand 114 states and 142 transitions. Second operand 25 states. [2019-11-26 21:28:34,149 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-26 21:28:34,715 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-11-26 21:28:35,252 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-11-26 21:28:35,699 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-11-26 21:28:36,287 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-11-26 21:28:37,126 WARN L192 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-11-26 21:28:38,198 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-26 21:28:41,140 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-26 21:28:41,719 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-11-26 21:28:42,526 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-26 21:28:43,016 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-26 21:28:44,478 WARN L192 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-26 21:28:45,396 WARN L192 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-11-26 21:28:45,896 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-26 21:28:47,010 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-26 21:28:48,382 WARN L192 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-26 21:28:48,903 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-26 21:28:50,983 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 98 DAG size of output: 97 [2019-11-26 21:28:51,697 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-26 21:28:53,352 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-11-26 21:28:54,683 WARN L192 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-11-26 21:28:56,221 WARN L192 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-26 21:28:57,761 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-26 21:28:58,510 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-26 21:28:59,601 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-26 21:29:00,834 WARN L192 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-26 21:29:02,008 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-26 21:29:02,739 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-26 21:29:03,587 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-26 21:29:04,733 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-26 21:29:05,315 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-26 21:29:05,896 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-26 21:29:06,499 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-26 21:29:09,044 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-26 21:29:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:29:09,132 INFO L93 Difference]: Finished difference Result 232 states and 277 transitions. [2019-11-26 21:29:09,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-26 21:29:09,134 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2019-11-26 21:29:09,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:29:09,136 INFO L225 Difference]: With dead ends: 232 [2019-11-26 21:29:09,136 INFO L226 Difference]: Without dead ends: 232 [2019-11-26 21:29:09,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=768, Invalid=3013, Unknown=1, NotChecked=0, Total=3782 [2019-11-26 21:29:09,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-26 21:29:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 144. [2019-11-26 21:29:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-26 21:29:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 185 transitions. [2019-11-26 21:29:09,151 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 185 transitions. Word has length 34 [2019-11-26 21:29:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:29:09,151 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 185 transitions. [2019-11-26 21:29:09,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-26 21:29:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 185 transitions. [2019-11-26 21:29:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 21:29:09,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:29:09,152 INFO L410 BasicCegarLoop]: trace histogram [3, 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-26 21:29:09,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-26 21:29:09,353 INFO L410 AbstractCegarLoop]: === Iteration 14 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:29:09,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:29:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1710485461, now seen corresponding path program 2 times [2019-11-26 21:29:09,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:29:09,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615699647] [2019-11-26 21:29:09,355 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-26 21:29:09,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 21:29:09,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:29:09,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 21:29:09,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:29:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:29:09,817 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:29:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:29:10,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615699647] [2019-11-26 21:29:10,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:29:10,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-11-26 21:29:10,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289328114] [2019-11-26 21:29:10,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 21:29:10,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:29:10,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 21:29:10,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-11-26 21:29:10,372 INFO L87 Difference]: Start difference. First operand 144 states and 185 transitions. Second operand 18 states. [2019-11-26 21:29:12,133 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-26 21:29:13,126 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-26 21:29:14,841 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-26 21:29:15,083 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-26 21:29:15,375 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-26 21:29:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:29:15,726 INFO L93 Difference]: Finished difference Result 281 states and 358 transitions. [2019-11-26 21:29:15,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-26 21:29:15,727 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-11-26 21:29:15,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:29:15,729 INFO L225 Difference]: With dead ends: 281 [2019-11-26 21:29:15,729 INFO L226 Difference]: Without dead ends: 281 [2019-11-26 21:29:15,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=382, Invalid=1598, Unknown=0, NotChecked=0, Total=1980 [2019-11-26 21:29:15,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-26 21:29:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 189. [2019-11-26 21:29:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-26 21:29:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2019-11-26 21:29:15,739 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 34 [2019-11-26 21:29:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:29:15,739 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2019-11-26 21:29:15,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 21:29:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2019-11-26 21:29:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 21:29:15,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:29:15,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:29:15,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-26 21:29:15,954 INFO L410 AbstractCegarLoop]: === Iteration 15 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:29:15,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:29:15,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1149138921, now seen corresponding path program 1 times [2019-11-26 21:29:15,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:29:15,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481746780] [2019-11-26 21:29:15,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-26 21:29:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:29:16,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 21:29:16,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:29:16,072 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-26 21:29:16,072 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:29:16,140 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-26 21:29:16,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481746780] [2019-11-26 21:29:16,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:29:16,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-26 21:29:16,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647917216] [2019-11-26 21:29:16,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:29:16,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:29:16,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:29:16,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:29:16,142 INFO L87 Difference]: Start difference. First operand 189 states and 252 transitions. Second operand 12 states. [2019-11-26 21:29:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:29:16,206 INFO L93 Difference]: Finished difference Result 228 states and 296 transitions. [2019-11-26 21:29:16,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 21:29:16,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-26 21:29:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:29:16,209 INFO L225 Difference]: With dead ends: 228 [2019-11-26 21:29:16,209 INFO L226 Difference]: Without dead ends: 228 [2019-11-26 21:29:16,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-26 21:29:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-26 21:29:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 197. [2019-11-26 21:29:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-26 21:29:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 260 transitions. [2019-11-26 21:29:16,219 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 260 transitions. Word has length 35 [2019-11-26 21:29:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:29:16,219 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 260 transitions. [2019-11-26 21:29:16,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:29:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2019-11-26 21:29:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-26 21:29:16,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:29:16,221 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:29:16,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-26 21:29:16,430 INFO L410 AbstractCegarLoop]: === Iteration 16 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:29:16,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:29:16,431 INFO L82 PathProgramCache]: Analyzing trace with hash -909618494, now seen corresponding path program 1 times [2019-11-26 21:29:16,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:29:16,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518975161] [2019-11-26 21:29:16,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-26 21:29:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:29:16,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-26 21:29:16,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:29:16,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-26 21:29:16,535 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:29:16,548 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:29:16,548 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:29:16,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-26 21:29:19,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-26 21:29:19,781 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:29:19,871 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:29:19,872 INFO L508 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-26 21:29:19,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:57 [2019-11-26 21:29:20,013 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-26 21:29:20,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-26 21:29:20,014 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:29:20,096 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:29:20,097 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-26 21:29:20,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:63, output treesize:59 [2019-11-26 21:29:24,189 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-26 21:29:24,206 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:29:24,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-11-26 21:29:24,207 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:29:24,343 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-11-26 21:29:24,343 INFO L588 ElimStorePlain]: treesize reduction 13, result has 82.2 percent of original size [2019-11-26 21:29:24,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:24,345 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-26 21:29:24,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:75, output treesize:42 [2019-11-26 21:29:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 21:29:32,655 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:29:47,741 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-26 21:29:47,933 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-26 21:29:48,039 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-26 21:29:48,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-11-26 21:29:48,065 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 21:29:48,086 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 21:29:48,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 243 [2019-11-26 21:29:48,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:48,462 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-26 21:29:48,695 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 16 [2019-11-26 21:29:48,696 INFO L588 ElimStorePlain]: treesize reduction 17299, result has 0.2 percent of original size [2019-11-26 21:29:48,696 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-26 21:29:48,703 INFO L588 ElimStorePlain]: treesize reduction 72, result has 1.4 percent of original size [2019-11-26 21:29:48,703 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:29:48,703 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:1 [2019-11-26 21:29:53,077 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-26 21:29:53,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 385 treesize of output 345 [2019-11-26 21:29:53,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:29:53,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:53,566 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-26 21:29:54,350 WARN L192 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 [2019-11-26 21:29:54,351 INFO L588 ElimStorePlain]: treesize reduction 2828, result has 2.1 percent of original size [2019-11-26 21:29:54,351 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:29:54,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2019-11-26 21:29:54,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:29:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 21:29:54,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518975161] [2019-11-26 21:29:54,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:29:54,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2019-11-26 21:29:54,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768576629] [2019-11-26 21:29:54,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-26 21:29:54,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:29:54,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-26 21:29:54,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=797, Unknown=13, NotChecked=0, Total=930 [2019-11-26 21:29:54,767 INFO L87 Difference]: Start difference. First operand 197 states and 260 transitions. Second operand 31 states. [2019-11-26 21:30:02,257 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-26 21:30:18,131 WARN L192 SmtUtils]: Spent 12.87 s on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-26 21:30:49,589 WARN L192 SmtUtils]: Spent 30.74 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-11-26 21:30:52,065 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 38 [2019-11-26 21:30:53,383 WARN L192 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2019-11-26 21:30:54,197 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-11-26 21:30:56,688 WARN L192 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-11-26 21:30:57,838 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-11-26 21:30:58,384 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-26 21:31:01,906 WARN L192 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-11-26 21:31:05,675 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-26 21:31:07,859 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-26 21:31:20,487 WARN L192 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-26 21:31:40,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:31:40,781 INFO L93 Difference]: Finished difference Result 209 states and 270 transitions. [2019-11-26 21:31:40,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-26 21:31:40,781 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2019-11-26 21:31:40,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:31:40,786 INFO L225 Difference]: With dead ends: 209 [2019-11-26 21:31:40,786 INFO L226 Difference]: Without dead ends: 201 [2019-11-26 21:31:40,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 119.8s TimeCoverageRelationStatistics Valid=414, Invalid=2532, Unknown=24, NotChecked=0, Total=2970 [2019-11-26 21:31:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-26 21:31:40,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 192. [2019-11-26 21:31:40,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-26 21:31:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 254 transitions. [2019-11-26 21:31:40,796 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 254 transitions. Word has length 40 [2019-11-26 21:31:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:31:40,797 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 254 transitions. [2019-11-26 21:31:40,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-26 21:31:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 254 transitions. [2019-11-26 21:31:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-26 21:31:40,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:31:40,798 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:31:41,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-26 21:31:41,008 INFO L410 AbstractCegarLoop]: === Iteration 17 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:31:41,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:31:41,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1501012420, now seen corresponding path program 2 times [2019-11-26 21:31:41,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:31:41,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276054193] [2019-11-26 21:31:41,010 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-26 21:31:41,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 21:31:41,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:31:41,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 21:31:41,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:31:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 21:31:41,200 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:31:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 21:31:41,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276054193] [2019-11-26 21:31:41,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:31:41,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-26 21:31:41,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589168182] [2019-11-26 21:31:41,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:31:41,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:31:41,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:31:41,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:31:41,411 INFO L87 Difference]: Start difference. First operand 192 states and 254 transitions. Second operand 12 states. [2019-11-26 21:31:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:31:41,651 INFO L93 Difference]: Finished difference Result 214 states and 276 transitions. [2019-11-26 21:31:41,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:31:41,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-11-26 21:31:41,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:31:41,653 INFO L225 Difference]: With dead ends: 214 [2019-11-26 21:31:41,653 INFO L226 Difference]: Without dead ends: 211 [2019-11-26 21:31:41,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-11-26 21:31:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-26 21:31:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2019-11-26 21:31:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-26 21:31:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 252 transitions. [2019-11-26 21:31:41,659 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 252 transitions. Word has length 42 [2019-11-26 21:31:41,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:31:41,660 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 252 transitions. [2019-11-26 21:31:41,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:31:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 252 transitions. [2019-11-26 21:31:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-26 21:31:41,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:31:41,661 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:31:41,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-26 21:31:41,862 INFO L410 AbstractCegarLoop]: === Iteration 18 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:31:41,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:31:41,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1547438402, now seen corresponding path program 1 times [2019-11-26 21:31:41,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:31:41,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527091833] [2019-11-26 21:31:41,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-26 21:31:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:31:41,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-26 21:31:41,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:31:41,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-26 21:31:41,953 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:31:41,954 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:31:41,954 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:31:41,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-11-26 21:31:41,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 21:31:41,974 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:31:41,980 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:31:41,980 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:31:41,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-26 21:31:42,022 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:31:42,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2019-11-26 21:31:42,024 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:31:42,076 INFO L588 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2019-11-26 21:31:42,077 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-26 21:31:42,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:11 [2019-11-26 21:31:42,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:31:42,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-26 21:31:42,135 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:31:42,137 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:31:42,138 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:31:42,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-26 21:31:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:31:42,167 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:31:42,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:31:42,409 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:31:42,433 INFO L588 ElimStorePlain]: treesize reduction 7, result has 63.2 percent of original size [2019-11-26 21:31:42,439 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:31:42,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2019-11-26 21:31:42,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2019-11-26 21:31:42,530 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:31:42,615 INFO L588 ElimStorePlain]: treesize reduction 21, result has 61.1 percent of original size [2019-11-26 21:31:42,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 21:31:42,617 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:31:42,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:18 [2019-11-26 21:31:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:31:42,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527091833] [2019-11-26 21:31:42,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:31:42,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 15 [2019-11-26 21:31:42,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711383614] [2019-11-26 21:31:42,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 21:31:42,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:31:42,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 21:31:42,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-11-26 21:31:42,669 INFO L87 Difference]: Start difference. First operand 192 states and 252 transitions. Second operand 15 states. [2019-11-26 21:31:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:31:59,880 INFO L93 Difference]: Finished difference Result 285 states and 355 transitions. [2019-11-26 21:31:59,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-26 21:31:59,883 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2019-11-26 21:31:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:31:59,885 INFO L225 Difference]: With dead ends: 285 [2019-11-26 21:31:59,885 INFO L226 Difference]: Without dead ends: 285 [2019-11-26 21:31:59,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-11-26 21:31:59,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-26 21:31:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 245. [2019-11-26 21:31:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-26 21:31:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 316 transitions. [2019-11-26 21:31:59,894 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 316 transitions. Word has length 43 [2019-11-26 21:31:59,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:31:59,895 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 316 transitions. [2019-11-26 21:31:59,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 21:31:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 316 transitions. [2019-11-26 21:31:59,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-26 21:31:59,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:31:59,896 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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-26 21:32:00,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-26 21:32:00,110 INFO L410 AbstractCegarLoop]: === Iteration 19 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:32:00,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:32:00,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1871293516, now seen corresponding path program 1 times [2019-11-26 21:32:00,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:32:00,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003595977] [2019-11-26 21:32:00,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-26 21:32:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:32:00,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-26 21:32:00,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:32:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:32:00,511 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:32:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:32:01,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003595977] [2019-11-26 21:32:01,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:32:01,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2019-11-26 21:32:01,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120488658] [2019-11-26 21:32:01,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 21:32:01,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:32:01,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 21:32:01,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2019-11-26 21:32:01,111 INFO L87 Difference]: Start difference. First operand 245 states and 316 transitions. Second operand 23 states. [2019-11-26 21:32:03,566 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2019-11-26 21:32:04,774 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-11-26 21:32:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:32:05,178 INFO L93 Difference]: Finished difference Result 376 states and 471 transitions. [2019-11-26 21:32:05,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-26 21:32:05,179 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-11-26 21:32:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:32:05,181 INFO L225 Difference]: With dead ends: 376 [2019-11-26 21:32:05,181 INFO L226 Difference]: Without dead ends: 376 [2019-11-26 21:32:05,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=549, Invalid=2313, Unknown=0, NotChecked=0, Total=2862 [2019-11-26 21:32:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-26 21:32:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 276. [2019-11-26 21:32:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-26 21:32:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 367 transitions. [2019-11-26 21:32:05,193 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 367 transitions. Word has length 42 [2019-11-26 21:32:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:32:05,193 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 367 transitions. [2019-11-26 21:32:05,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 21:32:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 367 transitions. [2019-11-26 21:32:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 21:32:05,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:32:05,195 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:32:05,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-26 21:32:05,403 INFO L410 AbstractCegarLoop]: === Iteration 20 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:32:05,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:32:05,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1715645055, now seen corresponding path program 1 times [2019-11-26 21:32:05,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:32:05,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426089765] [2019-11-26 21:32:05,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-26 21:32:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:32:05,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-26 21:32:05,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:32:05,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-26 21:32:05,515 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:05,523 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:05,523 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:32:05,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-26 21:32:05,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-26 21:32:05,651 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:05,666 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:05,667 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:32:05,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-26 21:32:05,727 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:05,727 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2019-11-26 21:32:05,728 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:05,769 INFO L588 ElimStorePlain]: treesize reduction 16, result has 61.9 percent of original size [2019-11-26 21:32:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:05,770 INFO L508 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-26 21:32:05,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:26 [2019-11-26 21:32:05,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:05,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:05,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:05,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:06,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-26 21:32:06,095 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:06,109 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:06,110 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:32:06,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:10 [2019-11-26 21:32:06,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:32:06,249 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:32:06,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:06,467 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-11-26 21:32:06,657 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:06,664 INFO L588 ElimStorePlain]: treesize reduction 27, result has 3.6 percent of original size [2019-11-26 21:32:06,665 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:32:06,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:1 [2019-11-26 21:32:06,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2019-11-26 21:32:06,816 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 21:32:06,901 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:06,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:06,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:32:06,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:06,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:32:06,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:06,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:32:06,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:32:06,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:06,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:06,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:32:06,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:06,906 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-11-26 21:32:06,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:214 [2019-11-26 21:32:07,200 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 17 [2019-11-26 21:32:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:32:07,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426089765] [2019-11-26 21:32:07,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-26 21:32:07,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 24 [2019-11-26 21:32:07,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395940709] [2019-11-26 21:32:07,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:32:07,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:32:07,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:32:07,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=486, Unknown=1, NotChecked=0, Total=552 [2019-11-26 21:32:07,421 INFO L87 Difference]: Start difference. First operand 276 states and 367 transitions. Second operand 12 states. [2019-11-26 21:32:07,827 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-11-26 21:32:08,168 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-11-26 21:32:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:32:09,044 INFO L93 Difference]: Finished difference Result 317 states and 412 transitions. [2019-11-26 21:32:09,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 21:32:09,046 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-11-26 21:32:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:32:09,048 INFO L225 Difference]: With dead ends: 317 [2019-11-26 21:32:09,048 INFO L226 Difference]: Without dead ends: 317 [2019-11-26 21:32:09,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=101, Invalid=768, Unknown=1, NotChecked=0, Total=870 [2019-11-26 21:32:09,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-26 21:32:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 293. [2019-11-26 21:32:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-11-26 21:32:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 385 transitions. [2019-11-26 21:32:09,058 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 385 transitions. Word has length 45 [2019-11-26 21:32:09,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:32:09,059 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 385 transitions. [2019-11-26 21:32:09,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:32:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 385 transitions. [2019-11-26 21:32:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-26 21:32:09,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:32:09,060 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1] [2019-11-26 21:32:09,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-26 21:32:09,278 INFO L410 AbstractCegarLoop]: === Iteration 21 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:32:09,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:32:09,279 INFO L82 PathProgramCache]: Analyzing trace with hash 670264949, now seen corresponding path program 3 times [2019-11-26 21:32:09,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:32:09,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961341988] [2019-11-26 21:32:09,280 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-26 21:32:09,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-26 21:32:09,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:32:09,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 21:32:09,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:32:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-26 21:32:09,523 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:32:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 21:32:09,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961341988] [2019-11-26 21:32:09,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-26 21:32:09,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-11-26 21:32:09,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849595994] [2019-11-26 21:32:09,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:32:09,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:32:09,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:32:09,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:32:09,596 INFO L87 Difference]: Start difference. First operand 293 states and 385 transitions. Second operand 5 states. [2019-11-26 21:32:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:32:09,718 INFO L93 Difference]: Finished difference Result 285 states and 364 transitions. [2019-11-26 21:32:09,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:32:09,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-26 21:32:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:32:09,724 INFO L225 Difference]: With dead ends: 285 [2019-11-26 21:32:09,725 INFO L226 Difference]: Without dead ends: 285 [2019-11-26 21:32:09,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:32:09,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-26 21:32:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 279. [2019-11-26 21:32:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-11-26 21:32:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 358 transitions. [2019-11-26 21:32:09,734 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 358 transitions. Word has length 44 [2019-11-26 21:32:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:32:09,735 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 358 transitions. [2019-11-26 21:32:09,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:32:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 358 transitions. [2019-11-26 21:32:09,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 21:32:09,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:32:09,736 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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-26 21:32:09,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-26 21:32:09,948 INFO L410 AbstractCegarLoop]: === Iteration 22 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:32:09,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:32:09,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2060287677, now seen corresponding path program 2 times [2019-11-26 21:32:09,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:32:09,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424798925] [2019-11-26 21:32:09,949 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-26 21:32:10,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 21:32:10,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:32:10,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-26 21:32:10,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:32:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:32:10,259 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:32:10,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:10,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2019-11-26 21:32:10,769 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 21:32:10,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-11-26 21:32:10,781 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 21:32:10,850 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:10,851 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-26 21:32:10,851 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:42 [2019-11-26 21:32:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:32:12,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424798925] [2019-11-26 21:32:12,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:32:12,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-26 21:32:12,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055309576] [2019-11-26 21:32:12,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-26 21:32:12,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:32:12,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-26 21:32:12,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-11-26 21:32:12,147 INFO L87 Difference]: Start difference. First operand 279 states and 358 transitions. Second operand 24 states. [2019-11-26 21:32:13,632 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-26 21:32:14,387 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-11-26 21:32:14,899 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-26 21:32:15,270 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-26 21:32:15,636 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-11-26 21:32:16,744 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-11-26 21:32:17,745 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-11-26 21:32:19,300 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-11-26 21:32:20,142 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-11-26 21:32:20,792 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-11-26 21:32:22,509 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-26 21:32:23,698 WARN L192 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-26 21:32:26,245 WARN L192 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-11-26 21:32:26,975 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-11-26 21:32:27,635 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-11-26 21:32:28,624 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-26 21:32:33,236 WARN L192 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-11-26 21:32:33,719 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-11-26 21:32:34,377 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-11-26 21:32:35,231 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-11-26 21:32:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:32:36,870 INFO L93 Difference]: Finished difference Result 500 states and 599 transitions. [2019-11-26 21:32:36,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-11-26 21:32:36,873 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2019-11-26 21:32:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:32:36,876 INFO L225 Difference]: With dead ends: 500 [2019-11-26 21:32:36,876 INFO L226 Difference]: Without dead ends: 500 [2019-11-26 21:32:36,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=950, Invalid=5212, Unknown=0, NotChecked=0, Total=6162 [2019-11-26 21:32:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-26 21:32:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 285. [2019-11-26 21:32:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-26 21:32:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 365 transitions. [2019-11-26 21:32:36,889 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 365 transitions. Word has length 47 [2019-11-26 21:32:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:32:36,889 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 365 transitions. [2019-11-26 21:32:36,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-26 21:32:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 365 transitions. [2019-11-26 21:32:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 21:32:36,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:32:36,890 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:32:37,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-26 21:32:37,102 INFO L410 AbstractCegarLoop]: === Iteration 23 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:32:37,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:32:37,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1338570350, now seen corresponding path program 1 times [2019-11-26 21:32:37,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:32:37,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514150749] [2019-11-26 21:32:37,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-26 21:32:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:32:37,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-26 21:32:37,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:32:37,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-26 21:32:37,234 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:37,242 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:37,242 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:32:37,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-26 21:32:37,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-26 21:32:37,370 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:37,386 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:37,386 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:32:37,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-26 21:32:37,453 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:37,454 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2019-11-26 21:32:37,455 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:37,498 INFO L588 ElimStorePlain]: treesize reduction 16, result has 61.9 percent of original size [2019-11-26 21:32:37,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:37,499 INFO L508 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-26 21:32:37,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:26 [2019-11-26 21:32:37,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:37,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:37,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:37,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:37,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-26 21:32:37,717 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:37,728 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:37,728 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:32:37,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:10 [2019-11-26 21:32:37,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:32:37,827 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:32:37,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:38,196 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:38,204 INFO L588 ElimStorePlain]: treesize reduction 27, result has 3.6 percent of original size [2019-11-26 21:32:38,205 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:32:38,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:1 [2019-11-26 21:32:38,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2019-11-26 21:32:38,361 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 21:32:38,447 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:38,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:38,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:32:38,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:38,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:32:38,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:38,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:32:38,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:32:38,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:38,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:32:38,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:32:38,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:38,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:38,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:38,453 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 15 dim-0 vars, and 4 xjuncts. [2019-11-26 21:32:38,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:264 [2019-11-26 21:32:38,818 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 17 [2019-11-26 21:32:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:32:39,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514150749] [2019-11-26 21:32:39,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:32:39,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2019-11-26 21:32:39,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448576326] [2019-11-26 21:32:39,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-26 21:32:39,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:32:39,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-26 21:32:39,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2019-11-26 21:32:39,141 INFO L87 Difference]: Start difference. First operand 285 states and 365 transitions. Second operand 26 states. [2019-11-26 21:32:39,655 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-11-26 21:32:40,212 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-26 21:32:41,209 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-11-26 21:32:41,880 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-26 21:32:42,476 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-11-26 21:32:43,126 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-11-26 21:32:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:32:44,487 INFO L93 Difference]: Finished difference Result 391 states and 475 transitions. [2019-11-26 21:32:44,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-26 21:32:44,488 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-11-26 21:32:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:32:44,490 INFO L225 Difference]: With dead ends: 391 [2019-11-26 21:32:44,490 INFO L226 Difference]: Without dead ends: 391 [2019-11-26 21:32:44,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=338, Invalid=2212, Unknown=0, NotChecked=0, Total=2550 [2019-11-26 21:32:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-11-26 21:32:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 289. [2019-11-26 21:32:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-26 21:32:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 368 transitions. [2019-11-26 21:32:44,504 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 368 transitions. Word has length 50 [2019-11-26 21:32:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:32:44,504 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 368 transitions. [2019-11-26 21:32:44,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-26 21:32:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 368 transitions. [2019-11-26 21:32:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 21:32:44,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:32:44,506 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-26 21:32:44,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-26 21:32:44,718 INFO L410 AbstractCegarLoop]: === Iteration 24 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-26 21:32:44,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:32:44,719 INFO L82 PathProgramCache]: Analyzing trace with hash 831936866, now seen corresponding path program 3 times [2019-11-26 21:32:44,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:32:44,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800572398] [2019-11-26 21:32:44,720 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-11-26 21:32:44,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-26 21:32:44,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:32:44,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-26 21:32:44,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:32:44,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-26 21:32:44,875 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:44,894 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:44,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:32:44,901 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:44,919 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:44,919 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:32:44,920 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2019-11-26 21:32:45,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-26 21:32:45,119 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:45,202 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:45,202 INFO L508 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-26 21:32:45,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:55 [2019-11-26 21:32:45,303 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-26 21:32:45,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-26 21:32:45,304 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:45,372 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:45,373 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-26 21:32:45,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:57 [2019-11-26 21:32:45,655 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-11-26 21:32:45,659 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_159|], 2=[|v_#length_77|]} [2019-11-26 21:32:45,679 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:45,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-26 21:32:45,680 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:45,799 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-26 21:32:45,800 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:45,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:32:45,832 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 21:32:45,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-26 21:32:45,833 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:45,978 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-11-26 21:32:45,979 INFO L588 ElimStorePlain]: treesize reduction 4, result has 94.2 percent of original size [2019-11-26 21:32:45,979 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-26 21:32:45,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:76, output treesize:65 [2019-11-26 21:32:46,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:32:46,114 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2019-11-26 21:32:46,114 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:32:46,159 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:46,160 INFO L508 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-26 21:32:46,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:58, output treesize:43 [2019-11-26 21:32:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-26 21:32:47,575 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:32:47,937 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-26 21:32:50,004 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-26 21:32:50,006 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-26 21:32:50,628 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-26 21:32:51,455 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-26 21:32:51,457 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-26 21:32:51,463 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-26 21:32:51,466 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-26 21:32:51,469 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-26 21:32:51,472 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-26 21:32:51,475 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-26 21:32:51,478 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-26 21:32:51,481 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-26 21:32:51,483 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-26 21:32:51,486 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-26 21:32:52,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-11-26 21:32:52,543 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:32:52,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 315 [2019-11-26 21:32:52,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:32:52,734 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-26 21:32:53,087 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 24 [2019-11-26 21:32:53,088 INFO L588 ElimStorePlain]: treesize reduction 7385, result has 1.0 percent of original size [2019-11-26 21:32:53,089 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-26 21:32:53,322 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-26 21:32:53,324 INFO L588 ElimStorePlain]: treesize reduction 49, result has 63.4 percent of original size [2019-11-26 21:32:53,324 INFO L508 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-26 21:32:53,325 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:85 [2019-11-26 21:32:53,718 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-26 21:33:02,508 WARN L192 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-26 21:33:15,355 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 77 [2019-11-26 21:33:15,395 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:33:15,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 453 treesize of output 417 [2019-11-26 21:33:15,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:15,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 21:33:15,570 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 10 xjuncts. [2019-11-26 21:33:24,371 WARN L192 SmtUtils]: Spent 8.80 s on a formula simplification. DAG size of input: 164 DAG size of output: 81 [2019-11-26 21:33:24,372 INFO L588 ElimStorePlain]: treesize reduction 60638, result has 0.3 percent of original size [2019-11-26 21:33:24,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:24,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:24,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:24,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:33:24,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-11-26 21:33:24,577 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (exists ((v_mkdup_~j~0_73 (_ BitVec 32)) (|v_main_~#i~2.base_35| (_ BitVec 32)) (|v_main_~#j~2.base_35| (_ BitVec 32)) (v_finddup_~j~1_116 (_ BitVec 32)) (v_mkdup_~i~0_73 (_ BitVec 32))) (forall ((v_prenex_40 (_ BitVec 32)) (v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse7 (bvmul v_prenex_42 (_ bv4 32)))) (let ((.cse0 (bvadd |mkdup_#in~a.offset| .cse7 (_ bv4 32))) (.cse3 (bvadd |mkdup_#in~a.offset| .cse7))) (or (not (bvule .cse0 (select (store (store |#length| v_prenex_40 (_ bv4 32)) v_prenex_41 (_ bv4 32)) |mkdup_#in~a.base|))) (let ((.cse1 (bvmul v_finddup_~j~1_116 (_ bv4 32)))) (let ((.cse2 (bvadd |mkdup_#in~a.offset| .cse1 (_ bv4 32)))) (and (bvule (bvadd |mkdup_#in~a.offset| .cse1) .cse2) (bvult |#StackHeapBarrier| |v_main_~#j~2.base_35|) (not (= (bvmul v_mkdup_~j~0_73 (_ bv4 32)) .cse1)) (bvule .cse2 (select (store (store |#length| |v_main_~#i~2.base_35| (_ bv4 32)) |v_main_~#j~2.base_35| (_ bv4 32)) |mkdup_#in~a.base|)) (= (select |#valid| |v_main_~#i~2.base_35|) (_ bv0 1)) (bvsle (_ bv0 32) v_mkdup_~j~0_73) (bvslt v_mkdup_~i~0_73 |mkdup_#in~n|) (not (= .cse1 (bvmul v_mkdup_~i~0_73 (_ bv4 32)))) (not (= v_mkdup_~j~0_73 v_mkdup_~i~0_73)) (bvsle (_ bv0 32) v_mkdup_~i~0_73) (bvslt v_mkdup_~j~0_73 |mkdup_#in~n|)))) (not (bvule .cse3 .cse0)) (let ((.cse4 (bvadd (bvmul mkdup_~i~0 (_ bv4 32)) mkdup_~a.offset)) (.cse5 (bvadd (bvmul mkdup_~j~0 (_ bv4 32)) mkdup_~a.offset))) (and (or (= .cse4 |mkdup_#in~a.offset|) (= .cse5 |mkdup_#in~a.offset|)) (let ((.cse6 (= |mkdup_#in~a.base| mkdup_~a.base))) (or (and (= .cse4 .cse3) .cse6) (and (= .cse5 .cse3) .cse6))))) (= |mkdup_#in~a.offset| .cse3) (bvslt (_ bv2 32) |mkdup_#in~n|) (not (= (select |#valid| v_prenex_40) (_ bv0 1))) (not (bvult |#StackHeapBarrier| v_prenex_41))))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:689) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:505) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 21:33:24,583 INFO L168 Benchmark]: Toolchain (without parser) took 349105.27 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.3 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -144.4 MB). Peak memory consumption was 379.2 MB. Max. memory is 11.5 GB. [2019-11-26 21:33:24,584 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:33:24,584 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-26 21:33:24,584 INFO L168 Benchmark]: Boogie Preprocessor took 57.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:33:24,585 INFO L168 Benchmark]: RCFGBuilder took 752.00 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2019-11-26 21:33:24,588 INFO L168 Benchmark]: TraceAbstraction took 347912.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.5 MB). Peak memory consumption was 363.1 MB. Max. memory is 11.5 GB. [2019-11-26 21:33:24,594 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 752.00 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 347912.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.5 MB). Peak memory consumption was 363.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (exists ((v_mkdup_~j~0_73 (_ BitVec 32)) (|v_main_~#i~2.base_35| (_ BitVec 32)) (|v_main_~#j~2.base_35| (_ BitVec 32)) (v_finddup_~j~1_116 (_ BitVec 32)) (v_mkdup_~i~0_73 (_ BitVec 32))) (forall ((v_prenex_40 (_ BitVec 32)) (v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse7 (bvmul v_prenex_42 (_ bv4 32)))) (let ((.cse0 (bvadd |mkdup_#in~a.offset| .cse7 (_ bv4 32))) (.cse3 (bvadd |mkdup_#in~a.offset| .cse7))) (or (not (bvule .cse0 (select (store (store |#length| v_prenex_40 (_ bv4 32)) v_prenex_41 (_ bv4 32)) |mkdup_#in~a.base|))) (let ((.cse1 (bvmul v_finddup_~j~1_116 (_ bv4 32)))) (let ((.cse2 (bvadd |mkdup_#in~a.offset| .cse1 (_ bv4 32)))) (and (bvule (bvadd |mkdup_#in~a.offset| .cse1) .cse2) (bvult |#StackHeapBarrier| |v_main_~#j~2.base_35|) (not (= (bvmul v_mkdup_~j~0_73 (_ bv4 32)) .cse1)) (bvule .cse2 (select (store (store |#length| |v_main_~#i~2.base_35| (_ bv4 32)) |v_main_~#j~2.base_35| (_ bv4 32)) |mkdup_#in~a.base|)) (= (select |#valid| |v_main_~#i~2.base_35|) (_ bv0 1)) (bvsle (_ bv0 32) v_mkdup_~j~0_73) (bvslt v_mkdup_~i~0_73 |mkdup_#in~n|) (not (= .cse1 (bvmul v_mkdup_~i~0_73 (_ bv4 32)))) (not (= v_mkdup_~j~0_73 v_mkdup_~i~0_73)) (bvsle (_ bv0 32) v_mkdup_~i~0_73) (bvslt v_mkdup_~j~0_73 |mkdup_#in~n|)))) (not (bvule .cse3 .cse0)) (let ((.cse4 (bvadd (bvmul mkdup_~i~0 (_ bv4 32)) mkdup_~a.offset)) (.cse5 (bvadd (bvmul mkdup_~j~0 (_ bv4 32)) mkdup_~a.offset))) (and (or (= .cse4 |mkdup_#in~a.offset|) (= .cse5 |mkdup_#in~a.offset|)) (let ((.cse6 (= |mkdup_#in~a.base| mkdup_~a.base))) (or (and (= .cse4 .cse3) .cse6) (and (= .cse5 .cse3) .cse6))))) (= |mkdup_#in~a.offset| .cse3) (bvslt (_ bv2 32) |mkdup_#in~n|) (not (= (select |#valid| v_prenex_40) (_ bv0 1))) (not (bvult |#StackHeapBarrier| v_prenex_41))))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (exists ((v_mkdup_~j~0_73 (_ BitVec 32)) (|v_main_~#i~2.base_35| (_ BitVec 32)) (|v_main_~#j~2.base_35| (_ BitVec 32)) (v_finddup_~j~1_116 (_ BitVec 32)) (v_mkdup_~i~0_73 (_ BitVec 32))) (forall ((v_prenex_40 (_ BitVec 32)) (v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse7 (bvmul v_prenex_42 (_ bv4 32)))) (let ((.cse0 (bvadd |mkdup_#in~a.offset| .cse7 (_ bv4 32))) (.cse3 (bvadd |mkdup_#in~a.offset| .cse7))) (or (not (bvule .cse0 (select (store (store |#length| v_prenex_40 (_ bv4 32)) v_prenex_41 (_ bv4 32)) |mkdup_#in~a.base|))) (let ((.cse1 (bvmul v_finddup_~j~1_116 (_ bv4 32)))) (let ((.cse2 (bvadd |mkdup_#in~a.offset| .cse1 (_ bv4 32)))) (and (bvule (bvadd |mkdup_#in~a.offset| .cse1) .cse2) (bvult |#StackHeapBarrier| |v_main_~#j~2.base_35|) (not (= (bvmul v_mkdup_~j~0_73 (_ bv4 32)) .cse1)) (bvule .cse2 (select (store (store |#length| |v_main_~#i~2.base_35| (_ bv4 32)) |v_main_~#j~2.base_35| (_ bv4 32)) |mkdup_#in~a.base|)) (= (select |#valid| |v_main_~#i~2.base_35|) (_ bv0 1)) (bvsle (_ bv0 32) v_mkdup_~j~0_73) (bvslt v_mkdup_~i~0_73 |mkdup_#in~n|) (not (= .cse1 (bvmul v_mkdup_~i~0_73 (_ bv4 32)))) (not (= v_mkdup_~j~0_73 v_mkdup_~i~0_73)) (bvsle (_ bv0 32) v_mkdup_~i~0_73) (bvslt v_mkdup_~j~0_73 |mkdup_#in~n|)))) (not (bvule .cse3 .cse0)) (let ((.cse4 (bvadd (bvmul mkdup_~i~0 (_ bv4 32)) mkdup_~a.offset)) (.cse5 (bvadd (bvmul mkdup_~j~0 (_ bv4 32)) mkdup_~a.offset))) (and (or (= .cse4 |mkdup_#in~a.offset|) (= .cse5 |mkdup_#in~a.offset|)) (let ((.cse6 (= |mkdup_#in~a.base| mkdup_~a.base))) (or (and (= .cse4 .cse3) .cse6) (and (= .cse5 .cse3) .cse6))))) (= |mkdup_#in~a.offset| .cse3) (bvslt (_ bv2 32) |mkdup_#in~n|) (not (= (select |#valid| v_prenex_40) (_ bv0 1))) (not (bvult |#StackHeapBarrier| v_prenex_41))))))): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:689) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...