./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 c9c8a757 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-c9c8a75 [2019-11-28 10:11:35,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 10:11:35,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 10:11:35,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 10:11:35,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 10:11:35,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 10:11:35,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 10:11:35,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 10:11:35,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 10:11:35,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 10:11:35,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 10:11:35,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 10:11:35,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 10:11:35,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 10:11:35,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 10:11:35,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 10:11:35,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 10:11:35,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 10:11:35,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 10:11:35,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 10:11:35,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 10:11:35,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 10:11:35,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 10:11:35,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 10:11:35,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 10:11:35,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 10:11:35,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 10:11:35,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 10:11:35,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 10:11:35,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 10:11:35,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 10:11:35,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 10:11:35,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 10:11:35,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 10:11:35,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 10:11:35,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 10:11:35,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 10:11:35,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 10:11:35,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 10:11:35,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 10:11:35,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 10:11:35,814 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 10:11:35,838 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 10:11:35,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 10:11:35,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 10:11:35,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 10:11:35,843 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 10:11:35,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 10:11:35,844 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 10:11:35,844 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 10:11:35,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 10:11:35,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 10:11:35,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 10:11:35,846 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 10:11:35,846 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 10:11:35,846 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 10:11:35,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 10:11:35,846 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 10:11:35,847 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 10:11:35,847 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 10:11:35,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 10:11:35,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 10:11:35,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 10:11:35,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 10:11:35,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:11:35,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 10:11:35,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 10:11:35,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 10:11:35,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 10:11:35,849 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-28 10:11:36,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 10:11:36,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 10:11:36,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 10:11:36,153 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 10:11:36,153 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 10:11:36,154 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2019-11-28 10:11:36,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547ddfaee/b3ef4d89e1aa48678f4f4d47832bbb0f/FLAGb8240781a [2019-11-28 10:11:36,627 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 10:11:36,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2019-11-28 10:11:36,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547ddfaee/b3ef4d89e1aa48678f4f4d47832bbb0f/FLAGb8240781a [2019-11-28 10:11:37,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547ddfaee/b3ef4d89e1aa48678f4f4d47832bbb0f [2019-11-28 10:11:37,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 10:11:37,039 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 10:11:37,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 10:11:37,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 10:11:37,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 10:11:37,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:11:37" (1/1) ... [2019-11-28 10:11:37,047 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 28.11 10:11:37, skipping insertion in model container [2019-11-28 10:11:37,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:11:37" (1/1) ... [2019-11-28 10:11:37,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 10:11:37,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:11:37,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:11:37,386 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 10:11:37,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:11:37,492 INFO L208 MainTranslator]: Completed translation [2019-11-28 10:11:37,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:37 WrapperNode [2019-11-28 10:11:37,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 10:11:37,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 10:11:37,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 10:11:37,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 10:11:37,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:37" (1/1) ... [2019-11-28 10:11:37,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:37" (1/1) ... [2019-11-28 10:11:37,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:37" (1/1) ... [2019-11-28 10:11:37,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:37" (1/1) ... [2019-11-28 10:11:37,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:37" (1/1) ... [2019-11-28 10:11:37,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:37" (1/1) ... [2019-11-28 10:11:37,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:37" (1/1) ... [2019-11-28 10:11:37,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 10:11:37,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 10:11:37,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 10:11:37,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 10:11:37,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:37" (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-28 10:11:37,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 10:11:37,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 10:11:37,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-28 10:11:37,604 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-11-28 10:11:37,604 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-11-28 10:11:37,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 10:11:37,605 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 10:11:37,605 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 10:11:37,605 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 10:11:37,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 10:11:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-28 10:11:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 10:11:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-28 10:11:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-11-28 10:11:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 10:11:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-11-28 10:11:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 10:11:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 10:11:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 10:11:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 10:11:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 10:11:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 10:11:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 10:11:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 10:11:38,129 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 10:11:38,129 INFO L297 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-28 10:11:38,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:11:38 BoogieIcfgContainer [2019-11-28 10:11:38,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 10:11:38,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 10:11:38,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 10:11:38,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 10:11:38,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:11:37" (1/3) ... [2019-11-28 10:11:38,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c58ff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:11:38, skipping insertion in model container [2019-11-28 10:11:38,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:11:37" (2/3) ... [2019-11-28 10:11:38,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c58ff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:11:38, skipping insertion in model container [2019-11-28 10:11:38,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:11:38" (3/3) ... [2019-11-28 10:11:38,139 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-28 10:11:38,146 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 10:11:38,153 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-11-28 10:11:38,166 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-11-28 10:11:38,189 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 10:11:38,189 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 10:11:38,189 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 10:11:38,189 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 10:11:38,189 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 10:11:38,189 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 10:11:38,190 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 10:11:38,190 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 10:11:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-28 10:11:38,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 10:11:38,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:38,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:38,242 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-28 10:11:38,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:38,249 INFO L82 PathProgramCache]: Analyzing trace with hash 205955921, now seen corresponding path program 1 times [2019-11-28 10:11:38,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:38,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544109091] [2019-11-28 10:11:38,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:38,583 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-28 10:11:38,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544109091] [2019-11-28 10:11:38,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:38,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 10:11:38,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33948103] [2019-11-28 10:11:38,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:11:38,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:38,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:11:38,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:11:38,610 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 8 states. [2019-11-28 10:11:39,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:39,364 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-28 10:11:39,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 10:11:39,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-28 10:11:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:39,384 INFO L225 Difference]: With dead ends: 105 [2019-11-28 10:11:39,385 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 10:11:39,393 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-28 10:11:39,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 10:11:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-11-28 10:11:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 10:11:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-28 10:11:39,478 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 14 [2019-11-28 10:11:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:39,479 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-28 10:11:39,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:11:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-28 10:11:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 10:11:39,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:39,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:39,483 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-28 10:11:39,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:39,484 INFO L82 PathProgramCache]: Analyzing trace with hash 205955922, now seen corresponding path program 1 times [2019-11-28 10:11:39,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:39,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067424903] [2019-11-28 10:11:39,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:39,754 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-28 10:11:39,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067424903] [2019-11-28 10:11:39,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:39,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 10:11:39,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695203851] [2019-11-28 10:11:39,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:11:39,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:39,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:11:39,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:11:39,760 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 8 states. [2019-11-28 10:11:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:40,371 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-11-28 10:11:40,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 10:11:40,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-28 10:11:40,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:40,373 INFO L225 Difference]: With dead ends: 101 [2019-11-28 10:11:40,374 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 10:11:40,375 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-28 10:11:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 10:11:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-11-28 10:11:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 10:11:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-11-28 10:11:40,386 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 14 [2019-11-28 10:11:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:40,386 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-11-28 10:11:40,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:11:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-11-28 10:11:40,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 10:11:40,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:40,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:40,388 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-28 10:11:40,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:40,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2089666347, now seen corresponding path program 1 times [2019-11-28 10:11:40,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:40,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239808895] [2019-11-28 10:11:40,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:40,558 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-28 10:11:40,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239808895] [2019-11-28 10:11:40,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:40,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 10:11:40,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731686666] [2019-11-28 10:11:40,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:11:40,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:40,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:11:40,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:11:40,561 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 8 states. [2019-11-28 10:11:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:41,085 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-11-28 10:11:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 10:11:41,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-28 10:11:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:41,087 INFO L225 Difference]: With dead ends: 100 [2019-11-28 10:11:41,087 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 10:11:41,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-28 10:11:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 10:11:41,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-11-28 10:11:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 10:11:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-28 10:11:41,099 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 15 [2019-11-28 10:11:41,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:41,100 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-28 10:11:41,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:11:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-28 10:11:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 10:11:41,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:41,101 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-28 10:11:41,101 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-28 10:11:41,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:41,102 INFO L82 PathProgramCache]: Analyzing trace with hash -905694587, now seen corresponding path program 1 times [2019-11-28 10:11:41,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:41,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359198122] [2019-11-28 10:11:41,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,229 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-28 10:11:41,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359198122] [2019-11-28 10:11:41,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:41,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 10:11:41,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524548082] [2019-11-28 10:11:41,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:11:41,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:41,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:11:41,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:11:41,232 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 8 states. [2019-11-28 10:11:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:41,715 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-28 10:11:41,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 10:11:41,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 10:11:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:41,718 INFO L225 Difference]: With dead ends: 98 [2019-11-28 10:11:41,718 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 10:11:41,718 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-28 10:11:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 10:11:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-28 10:11:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 10:11:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-28 10:11:41,726 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 23 [2019-11-28 10:11:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:41,726 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-28 10:11:41,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:11:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-28 10:11:41,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 10:11:41,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:41,728 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-28 10:11:41,728 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-28 10:11:41,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:41,728 INFO L82 PathProgramCache]: Analyzing trace with hash -905694586, now seen corresponding path program 1 times [2019-11-28 10:11:41,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:41,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597763469] [2019-11-28 10:11:41,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:41,913 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-28 10:11:41,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597763469] [2019-11-28 10:11:41,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:41,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 10:11:41,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710818929] [2019-11-28 10:11:41,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 10:11:41,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:41,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 10:11:41,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-28 10:11:41,916 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 11 states. [2019-11-28 10:11:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:42,892 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-28 10:11:42,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 10:11:42,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-28 10:11:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:42,894 INFO L225 Difference]: With dead ends: 118 [2019-11-28 10:11:42,894 INFO L226 Difference]: Without dead ends: 118 [2019-11-28 10:11:42,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-11-28 10:11:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-28 10:11:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2019-11-28 10:11:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 10:11:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2019-11-28 10:11:42,903 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 23 [2019-11-28 10:11:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:42,903 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2019-11-28 10:11:42,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 10:11:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2019-11-28 10:11:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 10:11:42,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:42,905 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-28 10:11:42,905 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-28 10:11:42,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:42,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1988238866, now seen corresponding path program 1 times [2019-11-28 10:11:42,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:42,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568842965] [2019-11-28 10:11:42,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:43,102 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-28 10:11:43,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568842965] [2019-11-28 10:11:43,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:43,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 10:11:43,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734683959] [2019-11-28 10:11:43,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 10:11:43,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:43,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 10:11:43,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:11:43,105 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 12 states. [2019-11-28 10:11:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:44,027 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2019-11-28 10:11:44,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 10:11:44,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-11-28 10:11:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:44,030 INFO L225 Difference]: With dead ends: 101 [2019-11-28 10:11:44,031 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 10:11:44,031 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-28 10:11:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 10:11:44,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-11-28 10:11:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 10:11:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2019-11-28 10:11:44,038 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 24 [2019-11-28 10:11:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:44,039 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2019-11-28 10:11:44,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 10:11:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2019-11-28 10:11:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 10:11:44,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:44,040 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-28 10:11:44,041 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-28 10:11:44,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:44,041 INFO L82 PathProgramCache]: Analyzing trace with hash -562897614, now seen corresponding path program 1 times [2019-11-28 10:11:44,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:44,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806831344] [2019-11-28 10:11:44,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,131 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-28 10:11:44,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806831344] [2019-11-28 10:11:44,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:44,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 10:11:44,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422691337] [2019-11-28 10:11:44,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 10:11:44,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 10:11:44,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:11:44,134 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 7 states. [2019-11-28 10:11:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:44,478 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2019-11-28 10:11:44,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:11:44,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-28 10:11:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:44,480 INFO L225 Difference]: With dead ends: 96 [2019-11-28 10:11:44,480 INFO L226 Difference]: Without dead ends: 96 [2019-11-28 10:11:44,481 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-28 10:11:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-28 10:11:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-28 10:11:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 10:11:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2019-11-28 10:11:44,487 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 26 [2019-11-28 10:11:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:44,488 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2019-11-28 10:11:44,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 10:11:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2019-11-28 10:11:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 10:11:44,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:44,489 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-28 10:11:44,489 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-28 10:11:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:44,490 INFO L82 PathProgramCache]: Analyzing trace with hash -562897613, now seen corresponding path program 1 times [2019-11-28 10:11:44,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:44,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287971247] [2019-11-28 10:11:44,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:44,609 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-28 10:11:44,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287971247] [2019-11-28 10:11:44,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:44,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 10:11:44,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81500484] [2019-11-28 10:11:44,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 10:11:44,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:44,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 10:11:44,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:11:44,613 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 7 states. [2019-11-28 10:11:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:44,944 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2019-11-28 10:11:44,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:11:44,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-28 10:11:44,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:44,946 INFO L225 Difference]: With dead ends: 91 [2019-11-28 10:11:44,947 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 10:11:44,947 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-28 10:11:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 10:11:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2019-11-28 10:11:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 10:11:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2019-11-28 10:11:44,952 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 26 [2019-11-28 10:11:44,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:44,953 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2019-11-28 10:11:44,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 10:11:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2019-11-28 10:11:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 10:11:44,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:44,954 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-28 10:11:44,954 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-28 10:11:44,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:44,955 INFO L82 PathProgramCache]: Analyzing trace with hash -564101073, now seen corresponding path program 1 times [2019-11-28 10:11:44,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:44,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667531234] [2019-11-28 10:11:44,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:45,024 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-28 10:11:45,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667531234] [2019-11-28 10:11:45,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958611943] [2019-11-28 10:11:45,025 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-28 10:11:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:45,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 10:11:45,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:11:45,121 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-28 10:11:45,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 10:11:45,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 8 [2019-11-28 10:11:45,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410153731] [2019-11-28 10:11:45,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:11:45,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:45,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:11:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:11:45,124 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 5 states. [2019-11-28 10:11:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:45,184 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2019-11-28 10:11:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:11:45,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 10:11:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:45,187 INFO L225 Difference]: With dead ends: 114 [2019-11-28 10:11:45,187 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 10:11:45,188 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-28 10:11:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 10:11:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2019-11-28 10:11:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 10:11:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-11-28 10:11:45,198 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 26 [2019-11-28 10:11:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:45,198 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-11-28 10:11:45,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:11:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-11-28 10:11:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 10:11:45,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:45,200 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-28 10:11:45,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 10:11:45,401 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-28 10:11:45,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:45,402 INFO L82 PathProgramCache]: Analyzing trace with hash -269956851, now seen corresponding path program 1 times [2019-11-28 10:11:45,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:45,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647863788] [2019-11-28 10:11:45,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:45,471 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-28 10:11:45,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647863788] [2019-11-28 10:11:45,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:45,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 10:11:45,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497474705] [2019-11-28 10:11:45,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 10:11:45,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:45,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 10:11:45,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:11:45,473 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 7 states. [2019-11-28 10:11:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:45,764 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-11-28 10:11:45,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:11:45,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-28 10:11:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:45,769 INFO L225 Difference]: With dead ends: 90 [2019-11-28 10:11:45,769 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 10:11:45,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-28 10:11:45,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 10:11:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-11-28 10:11:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 10:11:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-11-28 10:11:45,781 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 27 [2019-11-28 10:11:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:45,782 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-11-28 10:11:45,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 10:11:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-11-28 10:11:45,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 10:11:45,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:45,787 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-28 10:11:45,788 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-28 10:11:45,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:45,789 INFO L82 PathProgramCache]: Analyzing trace with hash -269956850, now seen corresponding path program 1 times [2019-11-28 10:11:45,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:45,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772412184] [2019-11-28 10:11:45,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:45,903 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-28 10:11:45,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772412184] [2019-11-28 10:11:45,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:45,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 10:11:45,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821136357] [2019-11-28 10:11:45,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 10:11:45,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:45,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 10:11:45,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:11:45,907 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 7 states. [2019-11-28 10:11:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:46,203 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-11-28 10:11:46,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:11:46,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-28 10:11:46,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:46,205 INFO L225 Difference]: With dead ends: 85 [2019-11-28 10:11:46,205 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 10:11:46,206 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-28 10:11:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 10:11:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-11-28 10:11:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 10:11:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2019-11-28 10:11:46,215 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 27 [2019-11-28 10:11:46,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:46,216 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2019-11-28 10:11:46,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 10:11:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2019-11-28 10:11:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 10:11:46,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:46,219 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-28 10:11:46,220 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-28 10:11:46,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:46,221 INFO L82 PathProgramCache]: Analyzing trace with hash -800191309, now seen corresponding path program 1 times [2019-11-28 10:11:46,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:46,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114464645] [2019-11-28 10:11:46,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:46,415 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-28 10:11:46,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114464645] [2019-11-28 10:11:46,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:46,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 10:11:46,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278719191] [2019-11-28 10:11:46,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 10:11:46,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:46,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 10:11:46,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-28 10:11:46,418 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 10 states. [2019-11-28 10:11:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:46,954 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-11-28 10:11:46,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 10:11:46,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-28 10:11:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:46,956 INFO L225 Difference]: With dead ends: 95 [2019-11-28 10:11:46,956 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 10:11:46,957 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-28 10:11:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 10:11:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2019-11-28 10:11:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 10:11:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2019-11-28 10:11:46,961 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 29 [2019-11-28 10:11:46,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:46,962 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2019-11-28 10:11:46,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 10:11:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2019-11-28 10:11:46,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 10:11:46,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:46,963 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-28 10:11:46,963 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-28 10:11:46,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:46,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2100210528, now seen corresponding path program 1 times [2019-11-28 10:11:46,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:46,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854525360] [2019-11-28 10:11:46,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:47,049 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-28 10:11:47,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854525360] [2019-11-28 10:11:47,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995414511] [2019-11-28 10:11:47,050 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-28 10:11:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:47,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 10:11:47,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:11:47,121 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-28 10:11:47,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:11:47,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-11-28 10:11:47,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595826811] [2019-11-28 10:11:47,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 10:11:47,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:47,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 10:11:47,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:11:47,124 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 9 states. [2019-11-28 10:11:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:47,572 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2019-11-28 10:11:47,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 10:11:47,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-28 10:11:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:47,574 INFO L225 Difference]: With dead ends: 121 [2019-11-28 10:11:47,574 INFO L226 Difference]: Without dead ends: 121 [2019-11-28 10:11:47,575 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-28 10:11:47,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-28 10:11:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-11-28 10:11:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 10:11:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2019-11-28 10:11:47,585 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 31 [2019-11-28 10:11:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:47,585 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2019-11-28 10:11:47,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 10:11:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2019-11-28 10:11:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 10:11:47,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:47,587 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-28 10:11:47,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 10:11:47,788 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-28 10:11:47,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:47,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1534703516, now seen corresponding path program 1 times [2019-11-28 10:11:47,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:47,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44336577] [2019-11-28 10:11:47,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:47,947 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-28 10:11:47,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44336577] [2019-11-28 10:11:47,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605146925] [2019-11-28 10:11:47,948 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-28 10:11:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:48,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 10:11:48,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:11:48,088 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-28 10:11:48,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:11:48,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2019-11-28 10:11:48,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729992951] [2019-11-28 10:11:48,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 10:11:48,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:48,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 10:11:48,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-11-28 10:11:48,094 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand 14 states. [2019-11-28 10:11:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:48,866 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2019-11-28 10:11:48,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 10:11:48,866 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-28 10:11:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:48,868 INFO L225 Difference]: With dead ends: 115 [2019-11-28 10:11:48,868 INFO L226 Difference]: Without dead ends: 110 [2019-11-28 10:11:48,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2019-11-28 10:11:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-28 10:11:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2019-11-28 10:11:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 10:11:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2019-11-28 10:11:48,873 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 32 [2019-11-28 10:11:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:48,873 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2019-11-28 10:11:48,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 10:11:48,873 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2019-11-28 10:11:48,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 10:11:48,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:48,874 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-28 10:11:49,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 10:11:49,079 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-28 10:11:49,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:49,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1149138921, now seen corresponding path program 1 times [2019-11-28 10:11:49,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:49,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371300973] [2019-11-28 10:11:49,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,160 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-28 10:11:49,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371300973] [2019-11-28 10:11:49,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:11:49,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 10:11:49,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766878676] [2019-11-28 10:11:49,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 10:11:49,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:49,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 10:11:49,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:11:49,162 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand 9 states. [2019-11-28 10:11:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:49,487 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2019-11-28 10:11:49,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 10:11:49,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-28 10:11:49,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:49,490 INFO L225 Difference]: With dead ends: 135 [2019-11-28 10:11:49,490 INFO L226 Difference]: Without dead ends: 135 [2019-11-28 10:11:49,491 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-28 10:11:49,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-28 10:11:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 104. [2019-11-28 10:11:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 10:11:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2019-11-28 10:11:49,498 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 35 [2019-11-28 10:11:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:49,498 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2019-11-28 10:11:49,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 10:11:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2019-11-28 10:11:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 10:11:49,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:49,499 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-28 10:11:49,500 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-28 10:11:49,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:49,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1466392881, now seen corresponding path program 2 times [2019-11-28 10:11:49,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:49,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847473703] [2019-11-28 10:11:49,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:49,601 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-28 10:11:49,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847473703] [2019-11-28 10:11:49,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544864128] [2019-11-28 10:11:49,602 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-28 10:11:49,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 10:11:49,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:11:49,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 10:11:49,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:11:49,935 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-28 10:11:49,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:11:49,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-28 10:11:49,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919988609] [2019-11-28 10:11:49,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 10:11:49,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:49,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 10:11:49,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-28 10:11:49,948 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 17 states. [2019-11-28 10:11:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:51,239 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2019-11-28 10:11:51,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 10:11:51,240 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-11-28 10:11:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:51,241 INFO L225 Difference]: With dead ends: 131 [2019-11-28 10:11:51,241 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 10:11:51,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2019-11-28 10:11:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 10:11:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2019-11-28 10:11:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 10:11:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2019-11-28 10:11:51,249 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 36 [2019-11-28 10:11:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:51,249 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2019-11-28 10:11:51,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 10:11:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2019-11-28 10:11:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 10:11:51,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:51,251 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-28 10:11:51,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 10:11:51,455 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-28 10:11:51,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:51,456 INFO L82 PathProgramCache]: Analyzing trace with hash -291785907, now seen corresponding path program 1 times [2019-11-28 10:11:51,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:51,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217984007] [2019-11-28 10:11:51,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:51,551 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-28 10:11:51,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217984007] [2019-11-28 10:11:51,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831964443] [2019-11-28 10:11:51,551 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-28 10:11:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:51,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 10:11:51,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:11:51,626 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-28 10:11:51,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:11:51,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2019-11-28 10:11:51,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121445915] [2019-11-28 10:11:51,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 10:11:51,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:51,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 10:11:51,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:11:51,630 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 7 states. [2019-11-28 10:11:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:51,886 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-11-28 10:11:51,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:11:51,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-11-28 10:11:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:51,888 INFO L225 Difference]: With dead ends: 93 [2019-11-28 10:11:51,888 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 10:11:51,889 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-28 10:11:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 10:11:51,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-11-28 10:11:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 10:11:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2019-11-28 10:11:51,892 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 37 [2019-11-28 10:11:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:51,892 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2019-11-28 10:11:51,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 10:11:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2019-11-28 10:11:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 10:11:51,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:51,893 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-28 10:11:52,094 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 10:11:52,095 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-28 10:11:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:52,095 INFO L82 PathProgramCache]: Analyzing trace with hash -909618494, now seen corresponding path program 2 times [2019-11-28 10:11:52,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:11:52,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908925196] [2019-11-28 10:11:52,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:11:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:52,478 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 37 [2019-11-28 10:11:52,689 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 64 [2019-11-28 10:11:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:53,161 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-28 10:11:53,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908925196] [2019-11-28 10:11:53,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328045698] [2019-11-28 10:11:53,162 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-28 10:11:53,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 10:11:53,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:11:53,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-28 10:11:53,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:11:53,325 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-28 10:11:53,325 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:11:53,345 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:11:53,346 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-28 10:11:53,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2019-11-28 10:11:53,422 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-28 10:11:53,423 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-28 10:11:53,423 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:11:53,436 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:11:53,437 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-28 10:11:53,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-11-28 10:11:54,788 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-28 10:11:54,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:11:54,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2019-11-28 10:11:54,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795949592] [2019-11-28 10:11:54,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 10:11:54,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:11:54,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 10:11:54,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-11-28 10:11:54,793 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 29 states. [2019-11-28 10:11:55,866 WARN L192 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-11-28 10:11:56,403 WARN L192 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-28 10:12:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:12:07,121 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2019-11-28 10:12:07,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 10:12:07,122 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2019-11-28 10:12:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:12:07,124 INFO L225 Difference]: With dead ends: 156 [2019-11-28 10:12:07,124 INFO L226 Difference]: Without dead ends: 148 [2019-11-28 10:12:07,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=234, Invalid=1836, Unknown=0, NotChecked=0, Total=2070 [2019-11-28 10:12:07,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-28 10:12:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2019-11-28 10:12:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 10:12:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-11-28 10:12:07,131 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 40 [2019-11-28 10:12:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:12:07,131 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-11-28 10:12:07,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 10:12:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-11-28 10:12:07,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 10:12:07,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:12:07,132 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-28 10:12:07,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 10:12:07,337 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-28 10:12:07,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:12:07,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1547438402, now seen corresponding path program 1 times [2019-11-28 10:12:07,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:12:07,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939998018] [2019-11-28 10:12:07,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:12:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:07,544 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-28 10:12:07,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939998018] [2019-11-28 10:12:07,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:12:07,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-28 10:12:07,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103803540] [2019-11-28 10:12:07,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 10:12:07,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:12:07,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 10:12:07,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-28 10:12:07,546 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 15 states. [2019-11-28 10:12:08,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:12:08,378 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2019-11-28 10:12:08,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 10:12:08,379 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2019-11-28 10:12:08,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:12:08,381 INFO L225 Difference]: With dead ends: 140 [2019-11-28 10:12:08,381 INFO L226 Difference]: Without dead ends: 140 [2019-11-28 10:12:08,382 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-28 10:12:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-28 10:12:08,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2019-11-28 10:12:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 10:12:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-11-28 10:12:08,387 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 43 [2019-11-28 10:12:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:12:08,388 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-11-28 10:12:08,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 10:12:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-11-28 10:12:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 10:12:08,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:12:08,389 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-28 10:12:08,390 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-28 10:12:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:12:08,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1715645055, now seen corresponding path program 1 times [2019-11-28 10:12:08,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:12:08,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203687441] [2019-11-28 10:12:08,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:12:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:08,953 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-28 10:12:08,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203687441] [2019-11-28 10:12:08,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68106565] [2019-11-28 10:12:08,955 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-28 10:12:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:09,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-28 10:12:09,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:12:09,055 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-28 10:12:09,055 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:12:09,061 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:12:09,062 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:12:09,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-28 10:12:09,231 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-28 10:12:09,231 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:12:09,239 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:12:09,239 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-28 10:12:09,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-11-28 10:12:09,292 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:12:09,293 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-28 10:12:09,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:12:09,297 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:12:09,335 INFO L588 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-28 10:12:09,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:12:09,337 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-28 10:12:09,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:31 [2019-11-28 10:12:09,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:12:09,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:12:09,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:12:09,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:12:09,688 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-28 10:12:09,689 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:12:09,698 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:12:09,699 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-28 10:12:09,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:12 [2019-11-28 10:12:09,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:12:09,794 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-28 10:12:09,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:12:09,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 35 [2019-11-28 10:12:09,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733322676] [2019-11-28 10:12:09,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-28 10:12:09,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:12:09,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-28 10:12:09,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2019-11-28 10:12:09,796 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 35 states. [2019-11-28 10:12:17,036 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-11-28 10:12:17,512 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-11-28 10:12:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:12:19,961 INFO L93 Difference]: Finished difference Result 183 states and 206 transitions. [2019-11-28 10:12:19,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-28 10:12:19,962 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2019-11-28 10:12:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:12:19,964 INFO L225 Difference]: With dead ends: 183 [2019-11-28 10:12:19,964 INFO L226 Difference]: Without dead ends: 183 [2019-11-28 10:12:19,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=463, Invalid=3959, Unknown=0, NotChecked=0, Total=4422 [2019-11-28 10:12:19,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-28 10:12:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2019-11-28 10:12:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-28 10:12:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2019-11-28 10:12:19,973 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 45 [2019-11-28 10:12:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:12:19,973 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2019-11-28 10:12:19,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-28 10:12:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2019-11-28 10:12:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 10:12:19,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:12:19,975 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-28 10:12:20,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 10:12:20,178 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-28 10:12:20,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:12:20,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1209011571, now seen corresponding path program 3 times [2019-11-28 10:12:20,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:12:20,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704553356] [2019-11-28 10:12:20,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:12:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:20,270 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-28 10:12:20,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704553356] [2019-11-28 10:12:20,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100615989] [2019-11-28 10:12:20,271 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-28 10:12:20,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 10:12:20,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:12:20,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-28 10:12:20,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:12:20,337 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-28 10:12:20,337 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:12:20,344 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:12:20,344 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:12:20,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-28 10:12:20,495 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-28 10:12:20,495 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:12:20,524 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:12:20,525 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-28 10:12:20,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:68 [2019-11-28 10:12:20,588 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-28 10:12:20,589 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-28 10:12:20,589 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:12:20,614 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:12:20,615 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-28 10:12:20,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:70 [2019-11-28 10:12:20,823 INFO L404 ElimStorePlain]: Different costs {2=[|v_#length_41|], 4=[|v_#valid_52|]} [2019-11-28 10:12:20,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:12:20,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:12:20,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:12:20,841 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-28 10:12:20,842 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:12:20,887 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:12:20,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:12:20,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:12:20,903 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:12:20,903 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-28 10:12:20,904 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:12:20,932 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:12:20,933 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-28 10:12:20,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:67 [2019-11-28 10:12:21,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:12:21,009 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-28 10:12:21,009 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:12:21,037 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:12:21,040 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-28 10:12:21,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:87, output treesize:51 [2019-11-28 10:12:22,725 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-28 10:12:22,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:12:22,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20] total 27 [2019-11-28 10:12:22,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009461238] [2019-11-28 10:12:22,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 10:12:22,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:12:22,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 10:12:22,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=606, Unknown=1, NotChecked=0, Total=702 [2019-11-28 10:12:22,727 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 27 states. [2019-11-28 10:12:25,214 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2019-11-28 10:12:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:12:36,869 INFO L93 Difference]: Finished difference Result 182 states and 203 transitions. [2019-11-28 10:12:36,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-28 10:12:36,869 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2019-11-28 10:12:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:12:36,871 INFO L225 Difference]: With dead ends: 182 [2019-11-28 10:12:36,871 INFO L226 Difference]: Without dead ends: 182 [2019-11-28 10:12:36,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=676, Invalid=3229, Unknown=1, NotChecked=0, Total=3906 [2019-11-28 10:12:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-28 10:12:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 149. [2019-11-28 10:12:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-28 10:12:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2019-11-28 10:12:36,881 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 45 [2019-11-28 10:12:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:12:36,881 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2019-11-28 10:12:36,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 10:12:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2019-11-28 10:12:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 10:12:36,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:12:36,883 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-28 10:12:37,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 10:12:37,086 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-28 10:12:37,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:12:37,087 INFO L82 PathProgramCache]: Analyzing trace with hash 936948074, now seen corresponding path program 1 times [2019-11-28 10:12:37,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:12:37,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089357363] [2019-11-28 10:12:37,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:12:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:37,239 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-28 10:12:37,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089357363] [2019-11-28 10:12:37,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:12:37,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 10:12:37,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670841379] [2019-11-28 10:12:37,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 10:12:37,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:12:37,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 10:12:37,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:12:37,241 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand 12 states. [2019-11-28 10:12:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:12:37,883 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2019-11-28 10:12:37,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 10:12:37,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-28 10:12:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:12:37,888 INFO L225 Difference]: With dead ends: 155 [2019-11-28 10:12:37,888 INFO L226 Difference]: Without dead ends: 155 [2019-11-28 10:12:37,889 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-28 10:12:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-28 10:12:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2019-11-28 10:12:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-28 10:12:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2019-11-28 10:12:37,894 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 54 [2019-11-28 10:12:37,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:12:37,895 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2019-11-28 10:12:37,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 10:12:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2019-11-28 10:12:37,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 10:12:37,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:12:37,896 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-28 10:12:37,896 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-28 10:12:37,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:12:37,896 INFO L82 PathProgramCache]: Analyzing trace with hash -21831271, now seen corresponding path program 4 times [2019-11-28 10:12:37,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:12:37,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906365319] [2019-11-28 10:12:37,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:12:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:37,986 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-28 10:12:37,991 INFO L168 Benchmark]: Toolchain (without parser) took 60951.65 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 416.8 MB). Free memory was 956.3 MB in the beginning and 842.7 MB in the end (delta: 113.6 MB). Peak memory consumption was 530.4 MB. Max. memory is 11.5 GB. [2019-11-28 10:12:37,991 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:12:37,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 453.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 10:12:37,992 INFO L168 Benchmark]: Boogie Preprocessor took 50.73 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-28 10:12:37,992 INFO L168 Benchmark]: RCFGBuilder took 586.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-11-28 10:12:37,993 INFO L168 Benchmark]: TraceAbstraction took 59856.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 270.5 MB). Free memory was 1.1 GB in the beginning and 842.7 MB in the end (delta: 255.5 MB). Peak memory consumption was 526.1 MB. Max. memory is 11.5 GB. [2019-11-28 10:12:37,995 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 453.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.73 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 586.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59856.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 270.5 MB). Free memory was 1.1 GB in the beginning and 842.7 MB in the end (delta: 255.5 MB). Peak memory consumption was 526.1 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-c9c8a75 [2019-11-28 10:12:40,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 10:12:40,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 10:12:40,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 10:12:40,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 10:12:40,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 10:12:40,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 10:12:40,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 10:12:40,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 10:12:40,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 10:12:40,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 10:12:40,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 10:12:40,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 10:12:40,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 10:12:40,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 10:12:40,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 10:12:40,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 10:12:40,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 10:12:40,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 10:12:40,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 10:12:40,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 10:12:40,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 10:12:40,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 10:12:40,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 10:12:40,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 10:12:40,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 10:12:40,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 10:12:40,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 10:12:40,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 10:12:40,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 10:12:40,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 10:12:40,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 10:12:40,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 10:12:40,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 10:12:40,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 10:12:40,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 10:12:40,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 10:12:40,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 10:12:40,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 10:12:40,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 10:12:40,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 10:12:40,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-28 10:12:40,225 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 10:12:40,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 10:12:40,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 10:12:40,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 10:12:40,229 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 10:12:40,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 10:12:40,230 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 10:12:40,230 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 10:12:40,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 10:12:40,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 10:12:40,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 10:12:40,231 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 10:12:40,232 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 10:12:40,232 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 10:12:40,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 10:12:40,233 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 10:12:40,233 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 10:12:40,233 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 10:12:40,233 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 10:12:40,233 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 10:12:40,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 10:12:40,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 10:12:40,234 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 10:12:40,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 10:12:40,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:12:40,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 10:12:40,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 10:12:40,236 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 10:12:40,236 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 10:12:40,237 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 10:12:40,237 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-28 10:12:40,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 10:12:40,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 10:12:40,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 10:12:40,572 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 10:12:40,572 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 10:12:40,573 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2019-11-28 10:12:40,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae3a619b/f0cac206bd1249f5b9c31403c947acaa/FLAG47523112a [2019-11-28 10:12:41,090 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 10:12:41,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2019-11-28 10:12:41,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae3a619b/f0cac206bd1249f5b9c31403c947acaa/FLAG47523112a [2019-11-28 10:12:41,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae3a619b/f0cac206bd1249f5b9c31403c947acaa [2019-11-28 10:12:41,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 10:12:41,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 10:12:41,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 10:12:41,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 10:12:41,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 10:12:41,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:12:41" (1/1) ... [2019-11-28 10:12:41,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e432ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:12:41, skipping insertion in model container [2019-11-28 10:12:41,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:12:41" (1/1) ... [2019-11-28 10:12:41,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 10:12:41,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:12:41,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:12:41,741 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 10:12:41,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:12:41,848 INFO L208 MainTranslator]: Completed translation [2019-11-28 10:12:41,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:12:41 WrapperNode [2019-11-28 10:12:41,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 10:12:41,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 10:12:41,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 10:12:41,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 10:12:41,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:12:41" (1/1) ... [2019-11-28 10:12:41,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:12:41" (1/1) ... [2019-11-28 10:12:41,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:12:41" (1/1) ... [2019-11-28 10:12:41,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:12:41" (1/1) ... [2019-11-28 10:12:41,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:12:41" (1/1) ... [2019-11-28 10:12:41,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:12:41" (1/1) ... [2019-11-28 10:12:41,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:12:41" (1/1) ... [2019-11-28 10:12:41,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 10:12:41,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 10:12:41,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 10:12:41,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 10:12:41,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:12:41" (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-28 10:12:41,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 10:12:41,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 10:12:41,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-28 10:12:41,956 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-11-28 10:12:41,957 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-11-28 10:12:41,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 10:12:41,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 10:12:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 10:12:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 10:12:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 10:12:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-28 10:12:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 10:12:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-28 10:12:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-11-28 10:12:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 10:12:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-11-28 10:12:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 10:12:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 10:12:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 10:12:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 10:12:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 10:12:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 10:12:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 10:12:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 10:12:42,642 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 10:12:42,642 INFO L297 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-28 10:12:42,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:12:42 BoogieIcfgContainer [2019-11-28 10:12:42,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 10:12:42,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 10:12:42,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 10:12:42,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 10:12:42,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:12:41" (1/3) ... [2019-11-28 10:12:42,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7900ddf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:12:42, skipping insertion in model container [2019-11-28 10:12:42,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:12:41" (2/3) ... [2019-11-28 10:12:42,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7900ddf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:12:42, skipping insertion in model container [2019-11-28 10:12:42,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:12:42" (3/3) ... [2019-11-28 10:12:42,652 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-28 10:12:42,662 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 10:12:42,669 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-11-28 10:12:42,682 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-11-28 10:12:42,699 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 10:12:42,700 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 10:12:42,700 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 10:12:42,700 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 10:12:42,700 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 10:12:42,700 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 10:12:42,701 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 10:12:42,701 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 10:12:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-28 10:12:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 10:12:42,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:12:42,731 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:12:42,732 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-28 10:12:42,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:12:42,738 INFO L82 PathProgramCache]: Analyzing trace with hash 205955921, now seen corresponding path program 1 times [2019-11-28 10:12:42,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:12:42,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956071048] [2019-11-28 10:12:42,751 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-28 10:12:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:42,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 10:12:42,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:12:42,931 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-28 10:12:42,931 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:12:42,942 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:12:42,942 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:12:42,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:12:43,024 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-28 10:12:43,027 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:12:43,068 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-28 10:12:43,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956071048] [2019-11-28 10:12:43,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:12:43,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 6 [2019-11-28 10:12:43,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854079079] [2019-11-28 10:12:43,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 10:12:43,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:12:43,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 10:12:43,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:12:43,097 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 7 states. [2019-11-28 10:12:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:12:43,670 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2019-11-28 10:12:43,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 10:12:43,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-28 10:12:43,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:12:43,685 INFO L225 Difference]: With dead ends: 103 [2019-11-28 10:12:43,685 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 10:12:43,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-28 10:12:43,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 10:12:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-28 10:12:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 10:12:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-28 10:12:43,742 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 14 [2019-11-28 10:12:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:12:43,742 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-28 10:12:43,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 10:12:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-28 10:12:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 10:12:43,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:12:43,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:12:43,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 10:12:43,965 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-28 10:12:43,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:12:43,965 INFO L82 PathProgramCache]: Analyzing trace with hash 205955922, now seen corresponding path program 1 times [2019-11-28 10:12:43,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:12:43,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454045169] [2019-11-28 10:12:43,967 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-28 10:12:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:12:44,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 10:12:44,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:12:44,060 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-28 10:12:44,061 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:12:44,080 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:12:44,081 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:12:44,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-28 10:12:44,389 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-28 10:12:44,390 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:12:46,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:12:47,154 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-28 10:12:47,385 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-28 10:12:47,957 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-28 10:12:47,991 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-28 10:12:47,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454045169] [2019-11-28 10:12:47,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:12:47,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-28 10:12:47,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728322648] [2019-11-28 10:12:47,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 10:12:47,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:12:47,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 10:12:47,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2019-11-28 10:12:47,996 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2019-11-28 10:13:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:13:10,102 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-28 10:13:10,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 10:13:10,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-11-28 10:13:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:13:10,106 INFO L225 Difference]: With dead ends: 99 [2019-11-28 10:13:10,106 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 10:13:10,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=41, Invalid=114, Unknown=1, NotChecked=0, Total=156 [2019-11-28 10:13:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 10:13:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-11-28 10:13:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 10:13:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-11-28 10:13:10,131 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 14 [2019-11-28 10:13:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:13:10,131 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-11-28 10:13:10,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 10:13:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-11-28 10:13:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 10:13:10,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:13:10,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:13:10,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 10:13:10,336 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-28 10:13:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:13:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2089666347, now seen corresponding path program 1 times [2019-11-28 10:13:10,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:13:10,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100677719] [2019-11-28 10:13:10,339 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-28 10:13:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:13:10,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 10:13:10,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:13:10,419 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-28 10:13:10,419 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:13:10,431 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:13:10,432 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:13:10,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-28 10:13:12,714 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-28 10:13:12,714 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:13:14,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:13:15,547 WARN L192 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2019-11-28 10:13:16,037 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-28 10:13:16,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100677719] [2019-11-28 10:13:16,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:13:16,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-28 10:13:16,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924736089] [2019-11-28 10:13:16,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 10:13:16,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:13:16,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 10:13:16,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=82, Unknown=2, NotChecked=0, Total=110 [2019-11-28 10:13:16,040 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 11 states. [2019-11-28 10:13:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:13:40,017 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-28 10:13:40,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 10:13:40,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-11-28 10:13:40,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:13:40,020 INFO L225 Difference]: With dead ends: 98 [2019-11-28 10:13:40,020 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 10:13:40,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=40, Invalid=114, Unknown=2, NotChecked=0, Total=156 [2019-11-28 10:13:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 10:13:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-28 10:13:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 10:13:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-28 10:13:40,034 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 15 [2019-11-28 10:13:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:13:40,034 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-28 10:13:40,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 10:13:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-28 10:13:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 10:13:40,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:13:40,036 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-28 10:13:40,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 10:13:40,247 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-28 10:13:40,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:13:40,248 INFO L82 PathProgramCache]: Analyzing trace with hash -905694587, now seen corresponding path program 1 times [2019-11-28 10:13:40,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:13:40,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482223372] [2019-11-28 10:13:40,250 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-28 10:13:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:13:40,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 10:13:40,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:13:40,350 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-28 10:13:40,350 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:13:40,353 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:13:40,354 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:13:40,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:13:40,553 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-11-28 10:13:40,554 INFO L343 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2019-11-28 10:13:40,554 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-28 10:13:40,555 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:13:40,588 INFO L588 ElimStorePlain]: treesize reduction 17, result has 54.1 percent of original size [2019-11-28 10:13:40,589 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-28 10:13:40,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2019-11-28 10:13:40,656 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-28 10:13:40,656 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:13:40,818 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-28 10:13:40,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482223372] [2019-11-28 10:13:40,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:13:40,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-28 10:13:40,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418282612] [2019-11-28 10:13:40,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 10:13:40,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:13:40,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 10:13:40,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:13:40,823 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 12 states. [2019-11-28 10:13:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:13:41,586 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-28 10:13:41,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 10:13:41,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-28 10:13:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:13:41,589 INFO L225 Difference]: With dead ends: 96 [2019-11-28 10:13:41,589 INFO L226 Difference]: Without dead ends: 96 [2019-11-28 10:13:41,590 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-28 10:13:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-28 10:13:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-11-28 10:13:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 10:13:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-28 10:13:41,598 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 23 [2019-11-28 10:13:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:13:41,599 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-28 10:13:41,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 10:13:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-28 10:13:41,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 10:13:41,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:13:41,600 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-28 10:13:41,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 10:13:41,803 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-28 10:13:41,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:13:41,804 INFO L82 PathProgramCache]: Analyzing trace with hash -905694586, now seen corresponding path program 1 times [2019-11-28 10:13:41,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:13:41,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997085015] [2019-11-28 10:13:41,807 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-28 10:13:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:13:41,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 10:13:41,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:13:41,881 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-28 10:13:41,882 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:13:41,896 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:13:41,909 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-28 10:13:41,909 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:13:41,934 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:13:41,935 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:13:41,935 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-11-28 10:13:42,164 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_72|], 2=[|v_#length_48|]} [2019-11-28 10:13:42,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:13:42,180 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-28 10:13:42,180 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:13:42,245 INFO L588 ElimStorePlain]: treesize reduction 3, result has 91.7 percent of original size [2019-11-28 10:13:42,297 INFO L343 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2019-11-28 10:13:42,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 35 [2019-11-28 10:13:42,299 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:13:42,387 INFO L588 ElimStorePlain]: treesize reduction 10, result has 79.2 percent of original size [2019-11-28 10:13:42,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:13:42,392 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-28 10:13:42,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:38 [2019-11-28 10:13:42,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:13:42,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:13:42,613 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-11-28 10:13:44,296 WARN L192 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-28 10:13:44,305 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-28 10:13:44,305 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:13:44,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:13:45,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:13:45,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:13:45,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:13:45,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:13:45,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:13:45,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:13:45,063 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 28 [2019-11-28 10:13:45,758 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 30 [2019-11-28 10:13:46,462 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-28 10:13:46,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997085015] [2019-11-28 10:13:46,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:13:46,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2019-11-28 10:13:46,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927842316] [2019-11-28 10:13:46,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 10:13:46,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:13:46,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 10:13:46,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-11-28 10:13:46,464 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 17 states. [2019-11-28 10:13:47,218 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-28 10:13:50,586 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-28 10:13:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:13:50,651 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-28 10:13:50,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 10:13:50,652 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-11-28 10:13:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:13:50,655 INFO L225 Difference]: With dead ends: 118 [2019-11-28 10:13:50,655 INFO L226 Difference]: Without dead ends: 118 [2019-11-28 10:13:50,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-11-28 10:13:50,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-28 10:13:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2019-11-28 10:13:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 10:13:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2019-11-28 10:13:50,664 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 23 [2019-11-28 10:13:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:13:50,664 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2019-11-28 10:13:50,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 10:13:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2019-11-28 10:13:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 10:13:50,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:13:50,665 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-28 10:13:50,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 10:13:50,883 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-28 10:13:50,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:13:50,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1988238866, now seen corresponding path program 1 times [2019-11-28 10:13:50,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:13:50,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9131838] [2019-11-28 10:13:50,885 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-28 10:13:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:13:51,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 10:13:51,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:13:51,049 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-28 10:13:51,050 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:13:51,075 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:13:51,084 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-28 10:13:51,084 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:13:51,111 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:13:51,112 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:13:51,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2019-11-28 10:13:51,314 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_79|], 2=[|v_#length_52|]} [2019-11-28 10:13:51,328 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:13:51,329 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-28 10:13:51,330 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:13:51,369 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:13:51,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:13:51,397 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-28 10:13:51,398 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-28 10:13:51,399 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:13:51,440 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:13:51,441 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-28 10:13:51,442 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:37 [2019-11-28 10:13:51,872 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-28 10:13:51,873 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:13:52,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:13:55,963 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-28 10:13:55,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9131838] [2019-11-28 10:13:55,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:13:55,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 18 [2019-11-28 10:13:55,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658647874] [2019-11-28 10:13:55,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 10:13:55,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:13:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 10:13:55,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-11-28 10:13:55,966 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 19 states. [2019-11-28 10:13:57,308 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-28 10:13:57,628 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-28 10:13:58,112 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-28 10:13:58,763 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-28 10:13:59,569 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-28 10:14:00,408 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-28 10:14:00,966 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-28 10:14:01,846 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-28 10:14:02,249 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-28 10:14:02,710 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-28 10:14:03,513 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-28 10:14:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:14:07,022 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2019-11-28 10:14:07,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 10:14:07,023 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-11-28 10:14:07,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:14:07,025 INFO L225 Difference]: With dead ends: 164 [2019-11-28 10:14:07,025 INFO L226 Difference]: Without dead ends: 164 [2019-11-28 10:14:07,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 10:14:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-28 10:14:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 115. [2019-11-28 10:14:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 10:14:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2019-11-28 10:14:07,035 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 24 [2019-11-28 10:14:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:14:07,036 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2019-11-28 10:14:07,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 10:14:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2019-11-28 10:14:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 10:14:07,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:14:07,038 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-28 10:14:07,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 10:14:07,242 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-28 10:14:07,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:14:07,243 INFO L82 PathProgramCache]: Analyzing trace with hash -562897614, now seen corresponding path program 1 times [2019-11-28 10:14:07,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:14:07,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929569551] [2019-11-28 10:14:07,245 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-28 10:14:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:14:07,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 10:14:07,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:14:07,338 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-28 10:14:07,338 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-28 10:14:07,338 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:14:07,345 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:14:07,346 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-28 10:14:07,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-28 10:14:07,382 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-28 10:14:07,383 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:14:07,417 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-28 10:14:07,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929569551] [2019-11-28 10:14:07,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:14:07,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-28 10:14:07,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301414793] [2019-11-28 10:14:07,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:14:07,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:14:07,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:14:07,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:14:07,421 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand 8 states. [2019-11-28 10:14:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:14:07,806 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-11-28 10:14:07,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:14:07,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-28 10:14:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:14:07,809 INFO L225 Difference]: With dead ends: 110 [2019-11-28 10:14:07,809 INFO L226 Difference]: Without dead ends: 110 [2019-11-28 10:14:07,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:14:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-28 10:14:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-11-28 10:14:07,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-28 10:14:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2019-11-28 10:14:07,816 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 26 [2019-11-28 10:14:07,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:14:07,817 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2019-11-28 10:14:07,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:14:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2019-11-28 10:14:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 10:14:07,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:14:07,818 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-28 10:14:08,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 10:14:08,033 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-28 10:14:08,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:14:08,034 INFO L82 PathProgramCache]: Analyzing trace with hash -562897613, now seen corresponding path program 1 times [2019-11-28 10:14:08,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:14:08,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773319121] [2019-11-28 10:14:08,034 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-28 10:14:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:14:08,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 10:14:08,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:14:08,156 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_56|], 1=[|v_#valid_90|]} [2019-11-28 10:14:08,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:14:08,165 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-28 10:14:08,165 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:14:08,177 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:14:08,183 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-28 10:14:08,184 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:14:08,202 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:14:08,203 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-28 10:14:08,203 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-11-28 10:14:08,275 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-28 10:14:08,275 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:14:08,413 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-28 10:14:08,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773319121] [2019-11-28 10:14:08,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:14:08,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-28 10:14:08,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257958006] [2019-11-28 10:14:08,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:14:08,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:14:08,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:14:08,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:14:08,415 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand 8 states. [2019-11-28 10:14:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:14:09,068 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2019-11-28 10:14:09,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:14:09,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-28 10:14:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:14:09,070 INFO L225 Difference]: With dead ends: 105 [2019-11-28 10:14:09,070 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 10:14:09,071 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-28 10:14:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 10:14:09,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-11-28 10:14:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-28 10:14:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-11-28 10:14:09,083 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 26 [2019-11-28 10:14:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:14:09,086 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-11-28 10:14:09,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:14:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2019-11-28 10:14:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 10:14:09,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:14:09,087 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-28 10:14:09,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 10:14:09,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-28 10:14:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:14:09,289 INFO L82 PathProgramCache]: Analyzing trace with hash -564101073, now seen corresponding path program 1 times [2019-11-28 10:14:09,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:14:09,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076075520] [2019-11-28 10:14:09,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-28 10:14:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:14:09,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 10:14:09,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:14:09,586 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-28 10:14:09,586 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:14:09,906 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-28 10:14:09,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076075520] [2019-11-28 10:14:09,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:14:09,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-28 10:14:09,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787872771] [2019-11-28 10:14:09,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 10:14:09,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:14:09,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 10:14:09,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-28 10:14:09,910 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 13 states. [2019-11-28 10:14:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:14:10,655 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2019-11-28 10:14:10,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 10:14:10,661 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-11-28 10:14:10,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:14:10,662 INFO L225 Difference]: With dead ends: 122 [2019-11-28 10:14:10,662 INFO L226 Difference]: Without dead ends: 122 [2019-11-28 10:14:10,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-28 10:14:10,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-28 10:14:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2019-11-28 10:14:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-28 10:14:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2019-11-28 10:14:10,669 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 26 [2019-11-28 10:14:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:14:10,670 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2019-11-28 10:14:10,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 10:14:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2019-11-28 10:14:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 10:14:10,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:14:10,672 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-28 10:14:10,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 10:14:10,893 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-28 10:14:10,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:14:10,894 INFO L82 PathProgramCache]: Analyzing trace with hash -269956851, now seen corresponding path program 1 times [2019-11-28 10:14:10,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:14:10,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399586965] [2019-11-28 10:14:10,894 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-28 10:14:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:14:10,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 10:14:10,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:14:10,974 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-28 10:14:10,975 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-28 10:14:10,976 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:14:10,982 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:14:10,983 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-28 10:14:10,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-28 10:14:11,004 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-28 10:14:11,004 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:14:11,013 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-28 10:14:11,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399586965] [2019-11-28 10:14:11,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:14:11,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 10:14:11,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530548406] [2019-11-28 10:14:11,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:14:11,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:14:11,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:14:11,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:14:11,015 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 5 states. [2019-11-28 10:14:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:14:11,254 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2019-11-28 10:14:11,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:14:11,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 10:14:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:14:11,257 INFO L225 Difference]: With dead ends: 100 [2019-11-28 10:14:11,257 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 10:14:11,258 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-28 10:14:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 10:14:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-28 10:14:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 10:14:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2019-11-28 10:14:11,263 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 27 [2019-11-28 10:14:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:14:11,263 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2019-11-28 10:14:11,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:14:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2019-11-28 10:14:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 10:14:11,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:14:11,264 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-28 10:14:11,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-28 10:14:11,466 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-28 10:14:11,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:14:11,466 INFO L82 PathProgramCache]: Analyzing trace with hash -269956850, now seen corresponding path program 1 times [2019-11-28 10:14:11,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:14:11,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822906293] [2019-11-28 10:14:11,468 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-28 10:14:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:14:11,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 10:14:11,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:14:11,554 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-28 10:14:11,554 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-28 10:14:11,554 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:14:11,561 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:14:11,561 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-28 10:14:11,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-28 10:14:11,603 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-28 10:14:11,603 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:14:11,735 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-28 10:14:11,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822906293] [2019-11-28 10:14:11,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:14:11,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-28 10:14:11,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192214229] [2019-11-28 10:14:11,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:14:11,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:14:11,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:14:11,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:14:11,738 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand 8 states. [2019-11-28 10:14:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:14:12,287 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2019-11-28 10:14:12,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:14:12,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-28 10:14:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:14:12,290 INFO L225 Difference]: With dead ends: 95 [2019-11-28 10:14:12,290 INFO L226 Difference]: Without dead ends: 95 [2019-11-28 10:14:12,290 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-28 10:14:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-28 10:14:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-11-28 10:14:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-28 10:14:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2019-11-28 10:14:12,295 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 27 [2019-11-28 10:14:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:14:12,295 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2019-11-28 10:14:12,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:14:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2019-11-28 10:14:12,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 10:14:12,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:14:12,297 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-28 10:14:12,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-28 10:14:12,502 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-28 10:14:12,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:14:12,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2100210528, now seen corresponding path program 1 times [2019-11-28 10:14:12,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:14:12,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204991665] [2019-11-28 10:14:12,504 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-28 10:14:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:14:12,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 10:14:12,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:14:12,676 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-28 10:14:12,677 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:14:12,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:14:12,948 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-28 10:14:12,949 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-28 10:14:12,964 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-28 10:14:12,965 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-28 10:14:13,023 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:14:13,024 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-28 10:14:13,024 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:42 [2019-11-28 10:14:13,535 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-28 10:14:13,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204991665] [2019-11-28 10:14:13,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:14:13,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-28 10:14:13,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380489333] [2019-11-28 10:14:13,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 10:14:13,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:14:13,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 10:14:13,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-28 10:14:13,537 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand 16 states. [2019-11-28 10:14:15,826 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-11-28 10:14:16,680 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-11-28 10:14:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:14:17,650 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2019-11-28 10:14:17,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 10:14:17,651 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-28 10:14:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:14:17,654 INFO L225 Difference]: With dead ends: 180 [2019-11-28 10:14:17,654 INFO L226 Difference]: Without dead ends: 180 [2019-11-28 10:14:17,655 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-28 10:14:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-28 10:14:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 114. [2019-11-28 10:14:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-28 10:14:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 142 transitions. [2019-11-28 10:14:17,663 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 142 transitions. Word has length 31 [2019-11-28 10:14:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:14:17,663 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 142 transitions. [2019-11-28 10:14:17,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 10:14:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 142 transitions. [2019-11-28 10:14:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 10:14:17,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:14:17,665 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-28 10:14:17,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-28 10:14:17,866 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-28 10:14:17,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:14:17,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1083087694, now seen corresponding path program 1 times [2019-11-28 10:14:17,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:14:17,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391674689] [2019-11-28 10:14:17,867 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-28 10:14:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:14:17,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 10:14:17,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:14:17,960 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-28 10:14:17,960 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:14:17,976 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:14:17,979 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-28 10:14:17,979 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:14:17,999 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:14:18,000 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:14:18,000 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-11-28 10:14:18,197 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_114|], 2=[|v_#length_65|]} [2019-11-28 10:14:18,209 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:14:18,209 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-28 10:14:18,210 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:14:18,235 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:14:18,300 INFO L343 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2019-11-28 10:14:18,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-28 10:14:18,301 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:14:18,358 INFO L588 ElimStorePlain]: treesize reduction 10, result has 77.8 percent of original size [2019-11-28 10:14:18,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:14:18,359 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-28 10:14:18,360 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:35 [2019-11-28 10:14:18,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:14:18,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:14:19,279 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-28 10:14:19,279 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:14:21,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:14:22,587 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-28 10:14:22,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391674689] [2019-11-28 10:14:22,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:14:22,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2019-11-28 10:14:22,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048289452] [2019-11-28 10:14:22,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 10:14:22,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:14:22,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 10:14:22,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-11-28 10:14:22,591 INFO L87 Difference]: Start difference. First operand 114 states and 142 transitions. Second operand 25 states. [2019-11-28 10:14:24,389 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-28 10:14:24,975 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-11-28 10:14:25,545 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-11-28 10:14:26,005 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-11-28 10:14:26,523 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-11-28 10:14:27,400 WARN L192 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-11-28 10:14:28,486 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 10:14:29,505 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-28 10:14:30,079 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-11-28 10:14:30,903 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-28 10:14:31,397 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-28 10:14:32,788 WARN L192 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-28 10:14:33,725 WARN L192 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-11-28 10:14:34,232 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-28 10:14:35,419 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 10:14:36,779 WARN L192 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-28 10:14:37,361 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-28 10:14:39,356 WARN L192 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 98 DAG size of output: 97 [2019-11-28 10:14:40,171 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-28 10:14:41,840 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-11-28 10:14:43,153 WARN L192 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-11-28 10:14:44,809 WARN L192 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-28 10:14:46,602 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 10:14:47,429 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-28 10:14:48,490 WARN L192 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 10:14:49,688 WARN L192 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-28 10:14:50,920 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 10:14:51,705 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-28 10:14:52,516 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 10:14:53,759 WARN L192 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 10:14:54,351 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-28 10:14:54,955 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 10:14:55,547 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-28 10:14:57,989 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-28 10:14:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:14:58,061 INFO L93 Difference]: Finished difference Result 232 states and 277 transitions. [2019-11-28 10:14:58,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-28 10:14:58,067 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2019-11-28 10:14:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:14:58,069 INFO L225 Difference]: With dead ends: 232 [2019-11-28 10:14:58,069 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 10:14:58,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=769, Invalid=3013, Unknown=0, NotChecked=0, Total=3782 [2019-11-28 10:14:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 10:14:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 144. [2019-11-28 10:14:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 10:14:58,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 185 transitions. [2019-11-28 10:14:58,083 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 185 transitions. Word has length 34 [2019-11-28 10:14:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:14:58,083 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 185 transitions. [2019-11-28 10:14:58,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 10:14:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 185 transitions. [2019-11-28 10:14:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 10:14:58,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:14:58,085 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-28 10:14:58,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-28 10:14:58,292 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-28 10:14:58,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:14:58,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1710485461, now seen corresponding path program 2 times [2019-11-28 10:14:58,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:14:58,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699743995] [2019-11-28 10:14:58,294 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-28 10:14:58,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 10:14:58,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:14:58,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 10:14:58,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:14:58,871 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-28 10:14:58,872 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:14:59,447 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-28 10:14:59,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699743995] [2019-11-28 10:14:59,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:14:59,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-11-28 10:14:59,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453219078] [2019-11-28 10:14:59,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 10:14:59,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:14:59,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 10:14:59,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-11-28 10:14:59,451 INFO L87 Difference]: Start difference. First operand 144 states and 185 transitions. Second operand 18 states. [2019-11-28 10:15:01,282 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-28 10:15:02,247 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-28 10:15:04,125 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-28 10:15:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:15:04,727 INFO L93 Difference]: Finished difference Result 281 states and 358 transitions. [2019-11-28 10:15:04,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-28 10:15:04,729 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-11-28 10:15:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:15:04,732 INFO L225 Difference]: With dead ends: 281 [2019-11-28 10:15:04,732 INFO L226 Difference]: Without dead ends: 281 [2019-11-28 10:15:04,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=382, Invalid=1598, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 10:15:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-28 10:15:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 189. [2019-11-28 10:15:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-28 10:15:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2019-11-28 10:15:04,742 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 34 [2019-11-28 10:15:04,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:15:04,742 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2019-11-28 10:15:04,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 10:15:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2019-11-28 10:15:04,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 10:15:04,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:15:04,743 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-28 10:15:04,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-28 10:15:04,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-28 10:15:04,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:15:04,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1149138921, now seen corresponding path program 1 times [2019-11-28 10:15:04,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:15:04,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753920994] [2019-11-28 10:15:04,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-28 10:15:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:15:05,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 10:15:05,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:15:05,069 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-28 10:15:05,069 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:15:05,137 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-28 10:15:05,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753920994] [2019-11-28 10:15:05,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:15:05,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-28 10:15:05,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992680483] [2019-11-28 10:15:05,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 10:15:05,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:15:05,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 10:15:05,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:15:05,139 INFO L87 Difference]: Start difference. First operand 189 states and 252 transitions. Second operand 12 states. [2019-11-28 10:15:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:15:05,211 INFO L93 Difference]: Finished difference Result 228 states and 296 transitions. [2019-11-28 10:15:05,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 10:15:05,212 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-28 10:15:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:15:05,213 INFO L225 Difference]: With dead ends: 228 [2019-11-28 10:15:05,213 INFO L226 Difference]: Without dead ends: 228 [2019-11-28 10:15:05,213 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-28 10:15:05,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-28 10:15:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 197. [2019-11-28 10:15:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-28 10:15:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 260 transitions. [2019-11-28 10:15:05,222 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 260 transitions. Word has length 35 [2019-11-28 10:15:05,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:15:05,223 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 260 transitions. [2019-11-28 10:15:05,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 10:15:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2019-11-28 10:15:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 10:15:05,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:15:05,224 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-28 10:15:05,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-28 10:15:05,444 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-28 10:15:05,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:15:05,444 INFO L82 PathProgramCache]: Analyzing trace with hash -909618494, now seen corresponding path program 1 times [2019-11-28 10:15:05,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:15:05,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017383325] [2019-11-28 10:15:05,445 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-28 10:15:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:15:05,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-28 10:15:05,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:15:05,553 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-28 10:15:05,554 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:15:05,568 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:15:05,568 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:15:05,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-28 10:15:06,581 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-28 10:15:06,581 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:15:06,671 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:15:06,671 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-28 10:15:06,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:57 [2019-11-28 10:15:06,793 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-28 10:15:06,793 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-28 10:15:06,793 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:15:06,867 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:15:06,868 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-28 10:15:06,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:63, output treesize:59 [2019-11-28 10:15:10,971 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-28 10:15:10,987 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:15:10,987 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-28 10:15:10,987 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:15:11,126 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-11-28 10:15:11,127 INFO L588 ElimStorePlain]: treesize reduction 13, result has 82.2 percent of original size [2019-11-28 10:15:11,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:11,129 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-28 10:15:11,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:75, output treesize:42 [2019-11-28 10:15:15,217 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-28 10:15:15,218 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:15:35,436 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-28 10:15:35,624 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-28 10:15:35,731 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-28 10:15:35,746 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-28 10:15:35,758 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 10:15:35,779 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 10:15:35,781 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-28 10:15:35,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:35,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:36,191 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-28 10:15:36,422 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 16 [2019-11-28 10:15:36,422 INFO L588 ElimStorePlain]: treesize reduction 17299, result has 0.2 percent of original size [2019-11-28 10:15:36,422 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-28 10:15:36,429 INFO L588 ElimStorePlain]: treesize reduction 72, result has 1.4 percent of original size [2019-11-28 10:15:36,429 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-28 10:15:36,429 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:1 [2019-11-28 10:15:40,803 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-28 10:15:40,804 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-28 10:15:40,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:40,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:40,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:15:41,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:41,268 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-28 10:15:42,078 WARN L192 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 [2019-11-28 10:15:42,079 INFO L588 ElimStorePlain]: treesize reduction 2828, result has 2.1 percent of original size [2019-11-28 10:15:42,079 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-28 10:15:42,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2019-11-28 10:15:44,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:15:44,518 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-28 10:15:44,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017383325] [2019-11-28 10:15:44,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:15:44,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2019-11-28 10:15:44,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265292057] [2019-11-28 10:15:44,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-28 10:15:44,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:15:44,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-28 10:15:44,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=798, Unknown=11, NotChecked=0, Total=930 [2019-11-28 10:15:44,520 INFO L87 Difference]: Start difference. First operand 197 states and 260 transitions. Second operand 31 states. [2019-11-28 10:15:50,627 WARN L192 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-28 10:16:08,121 WARN L192 SmtUtils]: Spent 12.68 s on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-28 10:16:41,344 WARN L192 SmtUtils]: Spent 32.77 s on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-11-28 10:16:44,280 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 38 [2019-11-28 10:16:44,584 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-28 10:16:46,851 WARN L192 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2019-11-28 10:16:48,864 WARN L192 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2019-11-28 10:16:49,501 WARN L192 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-11-28 10:16:52,063 WARN L192 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-11-28 10:16:54,711 WARN L192 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-11-28 10:16:58,647 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-28 10:17:02,980 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-11-28 10:17:08,277 WARN L192 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-28 10:17:11,602 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-28 10:17:14,422 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 57 [2019-11-28 10:17:16,310 WARN L192 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-28 10:17:28,878 WARN L192 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-28 10:17:33,455 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 36 [2019-11-28 10:18:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:18:13,274 INFO L93 Difference]: Finished difference Result 248 states and 316 transitions. [2019-11-28 10:18:13,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-28 10:18:13,276 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2019-11-28 10:18:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:18:13,278 INFO L225 Difference]: With dead ends: 248 [2019-11-28 10:18:13,278 INFO L226 Difference]: Without dead ends: 240 [2019-11-28 10:18:13,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 150.6s TimeCoverageRelationStatistics Valid=457, Invalid=2708, Unknown=27, NotChecked=0, Total=3192 [2019-11-28 10:18:13,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-28 10:18:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 192. [2019-11-28 10:18:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-28 10:18:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 254 transitions. [2019-11-28 10:18:13,287 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 254 transitions. Word has length 40 [2019-11-28 10:18:13,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:18:13,287 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 254 transitions. [2019-11-28 10:18:13,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-28 10:18:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 254 transitions. [2019-11-28 10:18:13,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 10:18:13,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:18:13,288 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-28 10:18:13,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-28 10:18:13,489 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-28 10:18:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:18:13,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1501012420, now seen corresponding path program 2 times [2019-11-28 10:18:13,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:18:13,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478498389] [2019-11-28 10:18:13,491 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-28 10:18:13,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 10:18:13,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:18:13,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 10:18:13,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:18:13,715 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-28 10:18:13,715 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:18:13,957 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-28 10:18:13,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478498389] [2019-11-28 10:18:13,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:18:13,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-28 10:18:13,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690943371] [2019-11-28 10:18:13,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 10:18:13,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:18:13,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 10:18:13,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:18:13,958 INFO L87 Difference]: Start difference. First operand 192 states and 254 transitions. Second operand 12 states. [2019-11-28 10:18:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:18:14,261 INFO L93 Difference]: Finished difference Result 214 states and 276 transitions. [2019-11-28 10:18:14,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:18:14,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-11-28 10:18:14,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:18:14,264 INFO L225 Difference]: With dead ends: 214 [2019-11-28 10:18:14,264 INFO L226 Difference]: Without dead ends: 211 [2019-11-28 10:18:14,264 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-28 10:18:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-28 10:18:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2019-11-28 10:18:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-28 10:18:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 252 transitions. [2019-11-28 10:18:14,274 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 252 transitions. Word has length 42 [2019-11-28 10:18:14,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:18:14,274 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 252 transitions. [2019-11-28 10:18:14,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 10:18:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 252 transitions. [2019-11-28 10:18:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 10:18:14,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:18:14,275 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-28 10:18:14,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-28 10:18:14,486 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-28 10:18:14,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:18:14,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1547438402, now seen corresponding path program 1 times [2019-11-28 10:18:14,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:18:14,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973707376] [2019-11-28 10:18:14,488 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-28 10:18:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:18:14,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 10:18:14,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:18:14,584 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-28 10:18:14,584 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:18:14,586 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:18:14,586 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:18:14,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-11-28 10:18:14,609 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-28 10:18:14,609 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:18:14,616 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:18:14,616 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:18:14,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-28 10:18:14,665 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:18:14,666 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-28 10:18:14,666 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:18:14,705 INFO L588 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2019-11-28 10:18:14,706 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-28 10:18:14,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:11 [2019-11-28 10:18:14,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:14,780 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-28 10:18:14,781 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:18:14,782 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:18:14,783 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-28 10:18:14,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-28 10:18:14,815 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-28 10:18:14,816 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:18:14,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:15,082 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:18:15,110 INFO L588 ElimStorePlain]: treesize reduction 7, result has 63.2 percent of original size [2019-11-28 10:18:15,111 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-28 10:18:15,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2019-11-28 10:18:15,186 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-28 10:18:15,188 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:18:15,277 INFO L588 ElimStorePlain]: treesize reduction 21, result has 61.1 percent of original size [2019-11-28 10:18:15,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-28 10:18:15,284 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-28 10:18:15,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:18 [2019-11-28 10:18:15,332 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-28 10:18:15,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973707376] [2019-11-28 10:18:15,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:18:15,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 15 [2019-11-28 10:18:15,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398160107] [2019-11-28 10:18:15,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 10:18:15,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:18:15,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 10:18:15,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-11-28 10:18:15,335 INFO L87 Difference]: Start difference. First operand 192 states and 252 transitions. Second operand 15 states. [2019-11-28 10:18:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:18:30,723 INFO L93 Difference]: Finished difference Result 285 states and 355 transitions. [2019-11-28 10:18:30,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 10:18:30,726 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2019-11-28 10:18:30,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:18:30,727 INFO L225 Difference]: With dead ends: 285 [2019-11-28 10:18:30,728 INFO L226 Difference]: Without dead ends: 285 [2019-11-28 10:18:30,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-11-28 10:18:30,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-28 10:18:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 245. [2019-11-28 10:18:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-28 10:18:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 316 transitions. [2019-11-28 10:18:30,737 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 316 transitions. Word has length 43 [2019-11-28 10:18:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:18:30,737 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 316 transitions. [2019-11-28 10:18:30,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 10:18:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 316 transitions. [2019-11-28 10:18:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 10:18:30,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:18:30,739 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-28 10:18:30,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-28 10:18:30,950 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-28 10:18:30,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:18:30,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1871293516, now seen corresponding path program 1 times [2019-11-28 10:18:30,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:18:30,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691600615] [2019-11-28 10:18:30,952 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-28 10:18:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:18:31,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 10:18:31,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:18:31,377 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-28 10:18:31,377 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:18:31,912 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-28 10:18:31,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691600615] [2019-11-28 10:18:31,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:18:31,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2019-11-28 10:18:31,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152795893] [2019-11-28 10:18:31,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 10:18:31,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:18:31,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 10:18:31,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2019-11-28 10:18:31,915 INFO L87 Difference]: Start difference. First operand 245 states and 316 transitions. Second operand 23 states. [2019-11-28 10:18:35,073 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2019-11-28 10:18:36,218 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-11-28 10:18:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:18:36,645 INFO L93 Difference]: Finished difference Result 376 states and 471 transitions. [2019-11-28 10:18:36,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-28 10:18:36,647 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-11-28 10:18:36,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:18:36,649 INFO L225 Difference]: With dead ends: 376 [2019-11-28 10:18:36,649 INFO L226 Difference]: Without dead ends: 376 [2019-11-28 10:18:36,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=549, Invalid=2313, Unknown=0, NotChecked=0, Total=2862 [2019-11-28 10:18:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-28 10:18:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 276. [2019-11-28 10:18:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-28 10:18:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 367 transitions. [2019-11-28 10:18:36,667 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 367 transitions. Word has length 42 [2019-11-28 10:18:36,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:18:36,668 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 367 transitions. [2019-11-28 10:18:36,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 10:18:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 367 transitions. [2019-11-28 10:18:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 10:18:36,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:18:36,669 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-28 10:18:36,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-28 10:18:36,880 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-28 10:18:36,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:18:36,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1715645055, now seen corresponding path program 1 times [2019-11-28 10:18:36,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:18:36,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083306002] [2019-11-28 10:18:36,882 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-28 10:18:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:18:36,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 10:18:36,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:18:37,003 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-28 10:18:37,003 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:18:37,010 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:18:37,010 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:18:37,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-28 10:18:37,143 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-28 10:18:37,143 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:18:37,161 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:18:37,161 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:18:37,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-28 10:18:37,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:18:37,225 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-28 10:18:37,225 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:18:37,269 INFO L588 ElimStorePlain]: treesize reduction 16, result has 61.9 percent of original size [2019-11-28 10:18:37,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:37,270 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-28 10:18:37,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:26 [2019-11-28 10:18:37,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:37,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:37,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:37,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:37,574 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-28 10:18:37,575 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:18:37,593 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:18:37,594 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-28 10:18:37,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:10 [2019-11-28 10:18:37,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:37,758 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-28 10:18:37,759 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:18:37,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:37,998 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-11-28 10:18:38,178 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-28 10:18:38,254 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:18:38,260 INFO L588 ElimStorePlain]: treesize reduction 27, result has 3.6 percent of original size [2019-11-28 10:18:38,260 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-28 10:18:38,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:1 [2019-11-28 10:18:38,435 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-28 10:18:38,436 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-28 10:18:38,526 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:18:38,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:38,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:18:38,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:38,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:18:38,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:38,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:18:38,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:18:38,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:38,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:38,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:18:38,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:38,533 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-28 10:18:38,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:214 [2019-11-28 10:18:38,828 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 17 [2019-11-28 10:18:39,095 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-28 10:18:39,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083306002] [2019-11-28 10:18:39,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 10:18:39,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 24 [2019-11-28 10:18:39,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938236116] [2019-11-28 10:18:39,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 10:18:39,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:18:39,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 10:18:39,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=486, Unknown=1, NotChecked=0, Total=552 [2019-11-28 10:18:39,097 INFO L87 Difference]: Start difference. First operand 276 states and 367 transitions. Second operand 12 states. [2019-11-28 10:18:39,363 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-28 10:18:39,577 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-11-28 10:18:39,980 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-11-28 10:18:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:18:40,884 INFO L93 Difference]: Finished difference Result 317 states and 412 transitions. [2019-11-28 10:18:40,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 10:18:40,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-11-28 10:18:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:18:40,887 INFO L225 Difference]: With dead ends: 317 [2019-11-28 10:18:40,887 INFO L226 Difference]: Without dead ends: 317 [2019-11-28 10:18:40,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=101, Invalid=768, Unknown=1, NotChecked=0, Total=870 [2019-11-28 10:18:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-28 10:18:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 293. [2019-11-28 10:18:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-11-28 10:18:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 385 transitions. [2019-11-28 10:18:40,899 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 385 transitions. Word has length 45 [2019-11-28 10:18:40,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:18:40,900 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 385 transitions. [2019-11-28 10:18:40,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 10:18:40,901 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 385 transitions. [2019-11-28 10:18:40,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 10:18:40,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:18:40,902 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-28 10:18:41,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-28 10:18:41,119 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-28 10:18:41,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:18:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash 670264949, now seen corresponding path program 3 times [2019-11-28 10:18:41,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:18:41,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580680392] [2019-11-28 10:18:41,121 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-28 10:18:41,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 10:18:41,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:18:41,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 10:18:41,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:18:41,321 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-28 10:18:41,321 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:18:41,410 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-28 10:18:41,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580680392] [2019-11-28 10:18:41,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 10:18:41,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-11-28 10:18:41,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396716450] [2019-11-28 10:18:41,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:18:41,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:18:41,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:18:41,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:18:41,412 INFO L87 Difference]: Start difference. First operand 293 states and 385 transitions. Second operand 5 states. [2019-11-28 10:18:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:18:41,532 INFO L93 Difference]: Finished difference Result 285 states and 364 transitions. [2019-11-28 10:18:41,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:18:41,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-28 10:18:41,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:18:41,538 INFO L225 Difference]: With dead ends: 285 [2019-11-28 10:18:41,538 INFO L226 Difference]: Without dead ends: 285 [2019-11-28 10:18:41,538 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-28 10:18:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-28 10:18:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 279. [2019-11-28 10:18:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-11-28 10:18:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 358 transitions. [2019-11-28 10:18:41,547 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 358 transitions. Word has length 44 [2019-11-28 10:18:41,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:18:41,548 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 358 transitions. [2019-11-28 10:18:41,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:18:41,548 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 358 transitions. [2019-11-28 10:18:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 10:18:41,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:18:41,549 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-28 10:18:41,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-28 10:18:41,761 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-28 10:18:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:18:41,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2060287677, now seen corresponding path program 2 times [2019-11-28 10:18:41,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:18:41,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776306548] [2019-11-28 10:18:41,764 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-28 10:18:41,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 10:18:41,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:18:41,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 10:18:41,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:18:42,089 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-28 10:18:42,090 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:18:42,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:18:42,803 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-28 10:18:42,804 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-28 10:18:42,816 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-28 10:18:42,817 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-28 10:18:42,876 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:18:42,877 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-28 10:18:42,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:42 [2019-11-28 10:18:43,160 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2019-11-28 10:18:44,254 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-28 10:18:44,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776306548] [2019-11-28 10:18:44,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:18:44,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-28 10:18:44,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512167715] [2019-11-28 10:18:44,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 10:18:44,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:18:44,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 10:18:44,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-11-28 10:18:44,257 INFO L87 Difference]: Start difference. First operand 279 states and 358 transitions. Second operand 24 states. [2019-11-28 10:18:45,792 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-28 10:18:46,570 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-11-28 10:18:47,120 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-28 10:18:47,541 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-28 10:18:47,926 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-11-28 10:18:49,156 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-11-28 10:18:50,347 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-11-28 10:18:51,695 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-11-28 10:18:52,041 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-11-28 10:18:52,958 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-11-28 10:18:53,671 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-11-28 10:18:54,547 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-28 10:18:55,190 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-28 10:18:55,589 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-28 10:18:56,797 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-28 10:18:58,055 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-11-28 10:18:59,376 WARN L192 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-11-28 10:19:00,281 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-11-28 10:19:01,011 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-11-28 10:19:02,437 WARN L192 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-28 10:19:07,560 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-11-28 10:19:08,069 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-11-28 10:19:08,821 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-11-28 10:19:09,719 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-11-28 10:19:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:19:11,588 INFO L93 Difference]: Finished difference Result 500 states and 599 transitions. [2019-11-28 10:19:11,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-11-28 10:19:11,590 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2019-11-28 10:19:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:19:11,593 INFO L225 Difference]: With dead ends: 500 [2019-11-28 10:19:11,593 INFO L226 Difference]: Without dead ends: 500 [2019-11-28 10:19:11,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=950, Invalid=5212, Unknown=0, NotChecked=0, Total=6162 [2019-11-28 10:19:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-28 10:19:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 285. [2019-11-28 10:19:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-28 10:19:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 365 transitions. [2019-11-28 10:19:11,606 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 365 transitions. Word has length 47 [2019-11-28 10:19:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:19:11,606 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 365 transitions. [2019-11-28 10:19:11,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 10:19:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 365 transitions. [2019-11-28 10:19:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 10:19:11,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:19:11,608 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-28 10:19:11,808 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-28 10:19:11,809 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-28 10:19:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:19:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1338570350, now seen corresponding path program 1 times [2019-11-28 10:19:11,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:19:11,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093319051] [2019-11-28 10:19:11,809 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-28 10:19:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:19:11,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 10:19:11,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:19:11,933 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-28 10:19:11,933 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:19:11,941 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:11,941 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:19:11,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-28 10:19:12,080 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-28 10:19:12,080 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:19:12,097 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:12,098 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:19:12,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-28 10:19:12,158 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:12,159 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-28 10:19:12,160 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:19:12,215 INFO L588 ElimStorePlain]: treesize reduction 16, result has 61.9 percent of original size [2019-11-28 10:19:12,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:12,216 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-28 10:19:12,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:26 [2019-11-28 10:19:12,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:12,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:12,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:12,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:12,476 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-28 10:19:12,476 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:19:12,486 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:12,487 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-28 10:19:12,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:10 [2019-11-28 10:19:12,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:12,588 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-28 10:19:12,588 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:19:12,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:13,005 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:19:13,012 INFO L588 ElimStorePlain]: treesize reduction 27, result has 3.6 percent of original size [2019-11-28 10:19:13,013 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-28 10:19:13,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:1 [2019-11-28 10:19:13,190 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-28 10:19:13,191 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-28 10:19:13,275 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:13,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:13,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:13,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:13,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:13,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:13,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:13,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:13,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:13,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:13,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:13,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:13,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:13,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:13,281 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-28 10:19:13,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:264 [2019-11-28 10:19:13,669 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 17 [2019-11-28 10:19:14,013 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-28 10:19:14,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093319051] [2019-11-28 10:19:14,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:19:14,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2019-11-28 10:19:14,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973480993] [2019-11-28 10:19:14,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 10:19:14,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:19:14,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 10:19:14,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2019-11-28 10:19:14,015 INFO L87 Difference]: Start difference. First operand 285 states and 365 transitions. Second operand 26 states. [2019-11-28 10:19:14,577 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-11-28 10:19:15,165 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-28 10:19:16,553 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-11-28 10:19:17,334 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-28 10:19:17,993 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-11-28 10:19:18,851 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-11-28 10:19:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:19:20,396 INFO L93 Difference]: Finished difference Result 391 states and 475 transitions. [2019-11-28 10:19:20,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-28 10:19:20,397 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-11-28 10:19:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:19:20,400 INFO L225 Difference]: With dead ends: 391 [2019-11-28 10:19:20,400 INFO L226 Difference]: Without dead ends: 391 [2019-11-28 10:19:20,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=338, Invalid=2212, Unknown=0, NotChecked=0, Total=2550 [2019-11-28 10:19:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-11-28 10:19:20,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 289. [2019-11-28 10:19:20,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-28 10:19:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 368 transitions. [2019-11-28 10:19:20,411 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 368 transitions. Word has length 50 [2019-11-28 10:19:20,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:19:20,411 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 368 transitions. [2019-11-28 10:19:20,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 10:19:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 368 transitions. [2019-11-28 10:19:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 10:19:20,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:19:20,413 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-28 10:19:20,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-28 10:19:20,624 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-28 10:19:20,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:19:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash 831936866, now seen corresponding path program 3 times [2019-11-28 10:19:20,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:19:20,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830198667] [2019-11-28 10:19:20,628 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-28 10:19:20,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 10:19:20,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:19:20,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-28 10:19:20,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:19:20,872 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-28 10:19:20,873 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:19:20,902 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:20,908 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-28 10:19:20,908 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:19:20,930 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:20,931 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:19:20,931 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2019-11-28 10:19:21,135 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-28 10:19:21,135 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:19:21,276 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-28 10:19:21,277 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:21,278 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-28 10:19:21,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:55 [2019-11-28 10:19:21,472 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-28 10:19:21,473 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-28 10:19:21,473 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:19:21,584 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-28 10:19:21,585 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:21,586 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-28 10:19:21,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:57 [2019-11-28 10:19:22,160 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_159|], 2=[|v_#length_77|]} [2019-11-28 10:19:22,187 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:22,187 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-28 10:19:22,188 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:19:22,317 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-28 10:19:22,318 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:22,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:19:22,351 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-28 10:19:22,352 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-28 10:19:22,352 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:19:22,509 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-11-28 10:19:22,510 INFO L588 ElimStorePlain]: treesize reduction 4, result has 94.2 percent of original size [2019-11-28 10:19:22,511 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-28 10:19:22,511 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:76, output treesize:65 [2019-11-28 10:19:22,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:19:22,649 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-28 10:19:22,650 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:19:22,696 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:22,697 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-28 10:19:22,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:58, output treesize:43 [2019-11-28 10:19:24,232 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-28 10:19:24,232 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:19:24,519 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-28 10:19:24,638 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-28 10:19:27,078 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 10:19:27,080 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-28 10:19:27,778 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-28 10:19:28,917 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-28 10:19:28,920 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-28 10:19:28,924 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-28 10:19:28,927 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-28 10:19:28,930 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-28 10:19:28,933 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-28 10:19:28,937 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-28 10:19:28,940 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-28 10:19:28,944 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-28 10:19:28,947 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-28 10:19:28,950 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-28 10:19:29,988 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-28 10:19:30,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:30,104 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-28 10:19:30,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:30,346 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-28 10:19:30,714 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 24 [2019-11-28 10:19:30,715 INFO L588 ElimStorePlain]: treesize reduction 7385, result has 1.0 percent of original size [2019-11-28 10:19:30,715 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-28 10:19:30,982 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-28 10:19:30,983 INFO L588 ElimStorePlain]: treesize reduction 49, result has 63.4 percent of original size [2019-11-28 10:19:30,984 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-28 10:19:30,984 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:85 [2019-11-28 10:19:31,422 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-28 10:19:40,465 WARN L192 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-28 10:19:52,941 WARN L192 SmtUtils]: Spent 3.63 s on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 10:19:53,490 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:19:53,490 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-28 10:19:53,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:19:53,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:19:53,679 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 10 xjuncts. [2019-11-28 10:20:02,827 WARN L192 SmtUtils]: Spent 9.15 s on a formula simplification. DAG size of input: 164 DAG size of output: 81 [2019-11-28 10:20:02,828 INFO L588 ElimStorePlain]: treesize reduction 60638, result has 0.3 percent of original size [2019-11-28 10:20:02,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:20:02,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:20:02,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:20:02,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:20:03,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-11-28 10:20:03,032 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-28 10:20:03,040 INFO L168 Benchmark]: Toolchain (without parser) took 441549.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 957.7 MB in the beginning and 923.8 MB in the end (delta: 33.9 MB). Peak memory consumption was 356.3 MB. Max. memory is 11.5 GB. [2019-11-28 10:20:03,040 INFO L168 Benchmark]: CDTParser took 0.20 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-28 10:20:03,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -122.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 10:20:03,043 INFO L168 Benchmark]: Boogie Preprocessor took 51.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 10:20:03,045 INFO L168 Benchmark]: RCFGBuilder took 742.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2019-11-28 10:20:03,050 INFO L168 Benchmark]: TraceAbstraction took 440393.44 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.0 GB in the beginning and 923.8 MB in the end (delta: 102.9 MB). Peak memory consumption was 341.0 MB. Max. memory is 11.5 GB. [2019-11-28 10:20:03,052 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.20 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 356.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -122.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 742.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 440393.44 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.0 GB in the beginning and 923.8 MB in the end (delta: 102.9 MB). Peak memory consumption was 341.0 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...