./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4bea9123dc38197075cd07fcd6899770fae2083a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4bea9123dc38197075cd07fcd6899770fae2083a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:14:24,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:14:24,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:14:24,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:14:24,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:14:24,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:14:24,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:14:24,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:14:24,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:14:24,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:14:24,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:14:24,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:14:24,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:14:24,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:14:24,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:14:24,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:14:24,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:14:24,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:14:24,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:14:24,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:14:24,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:14:24,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:14:24,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:14:24,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:14:24,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:14:24,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:14:24,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:14:24,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:14:24,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:14:24,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:14:24,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:14:24,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:14:24,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:14:24,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:14:24,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:14:24,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:14:24,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:14:24,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:14:24,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:14:24,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:14:24,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:14:24,207 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:14:24,219 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:14:24,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:14:24,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:14:24,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:14:24,220 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:14:24,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:14:24,221 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:14:24,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:14:24,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:14:24,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:14:24,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:14:24,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:14:24,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:14:24,222 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:14:24,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:14:24,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:14:24,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:14:24,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:14:24,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:14:24,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:14:24,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:14:24,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:14:24,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:14:24,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:14:24,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:14:24,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:14:24,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:14:24,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:14:24,225 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:14:24,225 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) 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 -> 4bea9123dc38197075cd07fcd6899770fae2083a [2019-12-07 14:14:24,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:14:24,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:14:24,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:14:24,342 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:14:24,342 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:14:24,343 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c [2019-12-07 14:14:24,381 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/data/249e31c0c/e07d6c1937a5479faecbda0f17ffcded/FLAG6252358d7 [2019-12-07 14:14:24,856 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:14:24,857 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c [2019-12-07 14:14:24,870 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/data/249e31c0c/e07d6c1937a5479faecbda0f17ffcded/FLAG6252358d7 [2019-12-07 14:14:24,878 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/data/249e31c0c/e07d6c1937a5479faecbda0f17ffcded [2019-12-07 14:14:24,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:14:24,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:14:24,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:14:24,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:14:24,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:14:24,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:14:24" (1/1) ... [2019-12-07 14:14:24,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6989fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:14:24, skipping insertion in model container [2019-12-07 14:14:24,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:14:24" (1/1) ... [2019-12-07 14:14:24,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:14:24,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:14:25,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:14:25,254 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:14:25,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:14:25,354 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:14:25,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:14:25 WrapperNode [2019-12-07 14:14:25,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:14:25,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:14:25,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:14:25,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:14:25,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:14:25" (1/1) ... [2019-12-07 14:14:25,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:14:25" (1/1) ... [2019-12-07 14:14:25,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:14:25,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:14:25,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:14:25,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:14:25,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:14:25" (1/1) ... [2019-12-07 14:14:25,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:14:25" (1/1) ... [2019-12-07 14:14:25,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:14:25" (1/1) ... [2019-12-07 14:14:25,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:14:25" (1/1) ... [2019-12-07 14:14:25,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:14:25" (1/1) ... [2019-12-07 14:14:25,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:14:25" (1/1) ... [2019-12-07 14:14:25,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:14:25" (1/1) ... [2019-12-07 14:14:25,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:14:25,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:14:25,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:14:25,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:14:25,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:14:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:14:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:14:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:14:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:14:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 14:14:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:14:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:14:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:14:25,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:14:25,703 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:14:26,201 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 14:14:26,201 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 14:14:26,202 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:14:26,202 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:14:26,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:14:26 BoogieIcfgContainer [2019-12-07 14:14:26,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:14:26,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:14:26,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:14:26,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:14:26,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:14:24" (1/3) ... [2019-12-07 14:14:26,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28cb5bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:14:26, skipping insertion in model container [2019-12-07 14:14:26,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:14:25" (2/3) ... [2019-12-07 14:14:26,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28cb5bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:14:26, skipping insertion in model container [2019-12-07 14:14:26,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:14:26" (3/3) ... [2019-12-07 14:14:26,210 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.c [2019-12-07 14:14:26,219 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:14:26,224 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:14:26,233 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:14:26,252 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:14:26,253 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:14:26,253 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:14:26,253 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:14:26,253 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:14:26,253 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:14:26,253 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:14:26,253 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:14:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 14:14:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:14:26,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:26,272 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-12-07 14:14:26,272 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:26,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-12-07 14:14:26,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:26,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107221478] [2019-12-07 14:14:26,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:26,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107221478] [2019-12-07 14:14:26,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:26,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:26,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403250] [2019-12-07 14:14:26,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:26,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:26,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:26,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:26,522 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-12-07 14:14:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:26,834 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-12-07 14:14:26,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:26,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 14:14:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:26,844 INFO L225 Difference]: With dead ends: 323 [2019-12-07 14:14:26,844 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 14:14:26,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 14:14:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-12-07 14:14:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 14:14:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-12-07 14:14:26,880 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-12-07 14:14:26,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:26,880 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-12-07 14:14:26,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-12-07 14:14:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 14:14:26,882 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:26,882 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:26,882 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:26,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:26,883 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2019-12-07 14:14:26,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:26,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288404835] [2019-12-07 14:14:26,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:26,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288404835] [2019-12-07 14:14:26,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:26,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:26,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744522952] [2019-12-07 14:14:26,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:26,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:26,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:26,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:26,954 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-12-07 14:14:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:27,191 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-12-07 14:14:27,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:27,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 14:14:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:27,193 INFO L225 Difference]: With dead ends: 290 [2019-12-07 14:14:27,193 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 14:14:27,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 14:14:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-12-07 14:14:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 14:14:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-12-07 14:14:27,203 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-12-07 14:14:27,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:27,203 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-12-07 14:14:27,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-12-07 14:14:27,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 14:14:27,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:27,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:27,205 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:27,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:27,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2019-12-07 14:14:27,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:27,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484928234] [2019-12-07 14:14:27,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:27,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484928234] [2019-12-07 14:14:27,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:27,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:27,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507554310] [2019-12-07 14:14:27,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:27,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:27,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:27,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:27,269 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-12-07 14:14:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:27,490 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-12-07 14:14:27,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:27,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 14:14:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:27,492 INFO L225 Difference]: With dead ends: 289 [2019-12-07 14:14:27,492 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 14:14:27,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 14:14:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-12-07 14:14:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 14:14:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-12-07 14:14:27,502 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-12-07 14:14:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:27,502 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-12-07 14:14:27,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-12-07 14:14:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 14:14:27,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:27,504 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, 1, 1, 1, 1] [2019-12-07 14:14:27,504 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:27,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:27,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2019-12-07 14:14:27,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:27,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904212132] [2019-12-07 14:14:27,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:27,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904212132] [2019-12-07 14:14:27,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:27,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:27,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047290507] [2019-12-07 14:14:27,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:27,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:27,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:27,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:27,566 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-12-07 14:14:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:27,781 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-12-07 14:14:27,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:27,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 14:14:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:27,782 INFO L225 Difference]: With dead ends: 287 [2019-12-07 14:14:27,782 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 14:14:27,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 14:14:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-12-07 14:14:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 14:14:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-12-07 14:14:27,788 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-12-07 14:14:27,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:27,788 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-12-07 14:14:27,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-12-07 14:14:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 14:14:27,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:27,789 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:27,789 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:27,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:27,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2019-12-07 14:14:27,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:27,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976647820] [2019-12-07 14:14:27,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:27,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976647820] [2019-12-07 14:14:27,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:27,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:27,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128325381] [2019-12-07 14:14:27,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:27,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:27,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:27,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:27,830 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-12-07 14:14:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:28,011 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-12-07 14:14:28,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:28,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 14:14:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:28,013 INFO L225 Difference]: With dead ends: 286 [2019-12-07 14:14:28,013 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 14:14:28,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 14:14:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 14:14:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 14:14:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-12-07 14:14:28,019 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-12-07 14:14:28,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:28,019 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-12-07 14:14:28,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-12-07 14:14:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 14:14:28,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:28,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:28,021 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:28,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:28,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2019-12-07 14:14:28,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:28,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382270651] [2019-12-07 14:14:28,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:28,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382270651] [2019-12-07 14:14:28,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:28,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:28,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695367358] [2019-12-07 14:14:28,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:28,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:28,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:28,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:28,062 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-12-07 14:14:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:28,249 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-12-07 14:14:28,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:28,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 14:14:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:28,250 INFO L225 Difference]: With dead ends: 286 [2019-12-07 14:14:28,250 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 14:14:28,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:28,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 14:14:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 14:14:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 14:14:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-12-07 14:14:28,255 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-12-07 14:14:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:28,255 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-12-07 14:14:28,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-12-07 14:14:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 14:14:28,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:28,256 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-12-07 14:14:28,256 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:28,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:28,256 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2019-12-07 14:14:28,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:28,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933148960] [2019-12-07 14:14:28,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:28,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933148960] [2019-12-07 14:14:28,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:28,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:28,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311700926] [2019-12-07 14:14:28,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:28,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:28,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:28,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:28,297 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-12-07 14:14:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:28,486 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-12-07 14:14:28,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:28,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 14:14:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:28,487 INFO L225 Difference]: With dead ends: 286 [2019-12-07 14:14:28,487 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 14:14:28,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:28,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 14:14:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 14:14:28,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 14:14:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-12-07 14:14:28,492 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-12-07 14:14:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:28,493 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-12-07 14:14:28,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-12-07 14:14:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 14:14:28,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:28,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:28,493 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:28,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:28,494 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2019-12-07 14:14:28,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:28,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261808736] [2019-12-07 14:14:28,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:28,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261808736] [2019-12-07 14:14:28,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:28,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:28,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236140571] [2019-12-07 14:14:28,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:28,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:28,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:28,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:28,535 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-12-07 14:14:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:28,737 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-12-07 14:14:28,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:28,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-07 14:14:28,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:28,739 INFO L225 Difference]: With dead ends: 286 [2019-12-07 14:14:28,739 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 14:14:28,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 14:14:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 14:14:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 14:14:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-12-07 14:14:28,744 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-12-07 14:14:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:28,744 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-12-07 14:14:28,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-12-07 14:14:28,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:14:28,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:28,745 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:28,745 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:28,746 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2019-12-07 14:14:28,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:28,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262416003] [2019-12-07 14:14:28,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:28,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262416003] [2019-12-07 14:14:28,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:28,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:28,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360888075] [2019-12-07 14:14:28,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:28,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:28,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:28,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:28,785 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-12-07 14:14:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:28,957 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-12-07 14:14:28,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:28,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 14:14:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:28,958 INFO L225 Difference]: With dead ends: 276 [2019-12-07 14:14:28,958 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 14:14:28,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 14:14:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-12-07 14:14:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 14:14:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-12-07 14:14:28,962 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-12-07 14:14:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:28,962 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-12-07 14:14:28,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-12-07 14:14:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:14:28,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:28,963 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:28,963 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:28,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:28,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2019-12-07 14:14:28,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:28,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259821575] [2019-12-07 14:14:28,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:29,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259821575] [2019-12-07 14:14:29,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:29,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:29,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319167672] [2019-12-07 14:14:29,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:29,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:29,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:29,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:29,010 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-12-07 14:14:29,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:29,222 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-12-07 14:14:29,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:29,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 14:14:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:29,224 INFO L225 Difference]: With dead ends: 316 [2019-12-07 14:14:29,225 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 14:14:29,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 14:14:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-12-07 14:14:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 14:14:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-12-07 14:14:29,230 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-12-07 14:14:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:29,231 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-12-07 14:14:29,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-12-07 14:14:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 14:14:29,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:29,232 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:29,232 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:29,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2019-12-07 14:14:29,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:29,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273223276] [2019-12-07 14:14:29,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:29,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273223276] [2019-12-07 14:14:29,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:29,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:29,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995556240] [2019-12-07 14:14:29,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:29,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:29,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:29,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:29,273 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-12-07 14:14:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:29,521 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-12-07 14:14:29,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:29,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 14:14:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:29,522 INFO L225 Difference]: With dead ends: 338 [2019-12-07 14:14:29,522 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 14:14:29,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 14:14:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-12-07 14:14:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 14:14:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-12-07 14:14:29,526 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-12-07 14:14:29,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:29,526 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-12-07 14:14:29,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-12-07 14:14:29,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:14:29,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:29,528 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:29,528 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:29,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:29,528 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2019-12-07 14:14:29,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:29,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121499064] [2019-12-07 14:14:29,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:29,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121499064] [2019-12-07 14:14:29,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:29,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:29,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987411391] [2019-12-07 14:14:29,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:29,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:29,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:29,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:29,561 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-12-07 14:14:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:29,757 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-12-07 14:14:29,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:29,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 14:14:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:29,759 INFO L225 Difference]: With dead ends: 337 [2019-12-07 14:14:29,759 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 14:14:29,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 14:14:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-12-07 14:14:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 14:14:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-12-07 14:14:29,763 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-12-07 14:14:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:29,763 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-12-07 14:14:29,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-12-07 14:14:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:14:29,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:29,764 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:29,764 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:29,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:29,764 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2019-12-07 14:14:29,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:29,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101182453] [2019-12-07 14:14:29,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:29,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101182453] [2019-12-07 14:14:29,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:29,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:29,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081148865] [2019-12-07 14:14:29,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:29,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:29,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:29,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:29,793 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-12-07 14:14:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:29,998 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-12-07 14:14:29,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:29,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 14:14:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:29,999 INFO L225 Difference]: With dead ends: 335 [2019-12-07 14:14:29,999 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 14:14:30,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 14:14:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-12-07 14:14:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 14:14:30,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-12-07 14:14:30,003 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-12-07 14:14:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:30,003 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-12-07 14:14:30,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-12-07 14:14:30,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:14:30,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:30,004 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:30,004 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:30,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:30,004 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2019-12-07 14:14:30,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:30,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921544492] [2019-12-07 14:14:30,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:30,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921544492] [2019-12-07 14:14:30,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:30,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:30,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379298285] [2019-12-07 14:14:30,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:30,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:30,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:30,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:30,033 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-12-07 14:14:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:30,257 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-12-07 14:14:30,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:30,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 14:14:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:30,259 INFO L225 Difference]: With dead ends: 334 [2019-12-07 14:14:30,259 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 14:14:30,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 14:14:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 14:14:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 14:14:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-12-07 14:14:30,263 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-12-07 14:14:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:30,263 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-12-07 14:14:30,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-12-07 14:14:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:14:30,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:30,263 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:30,264 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:30,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:30,264 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2019-12-07 14:14:30,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:30,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235574040] [2019-12-07 14:14:30,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:30,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235574040] [2019-12-07 14:14:30,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:30,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:30,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819744735] [2019-12-07 14:14:30,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:30,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:30,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:30,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:30,303 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-12-07 14:14:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:30,517 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-12-07 14:14:30,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:30,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 14:14:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:30,519 INFO L225 Difference]: With dead ends: 334 [2019-12-07 14:14:30,519 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 14:14:30,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:30,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 14:14:30,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 14:14:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 14:14:30,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-12-07 14:14:30,523 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-12-07 14:14:30,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:30,523 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-12-07 14:14:30,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:30,523 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-12-07 14:14:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:14:30,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:30,523 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:30,524 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:30,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2019-12-07 14:14:30,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:30,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969996733] [2019-12-07 14:14:30,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:30,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969996733] [2019-12-07 14:14:30,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:30,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:30,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228125900] [2019-12-07 14:14:30,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:30,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:30,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:30,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:30,549 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-12-07 14:14:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:30,749 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-12-07 14:14:30,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:30,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 14:14:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:30,751 INFO L225 Difference]: With dead ends: 334 [2019-12-07 14:14:30,751 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 14:14:30,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 14:14:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 14:14:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 14:14:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-12-07 14:14:30,754 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-12-07 14:14:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:30,754 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-12-07 14:14:30,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-12-07 14:14:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 14:14:30,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:30,755 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:30,755 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:30,755 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2019-12-07 14:14:30,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:30,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257956426] [2019-12-07 14:14:30,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:30,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257956426] [2019-12-07 14:14:30,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:30,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:30,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407726006] [2019-12-07 14:14:30,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:30,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:30,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:30,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:30,781 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-12-07 14:14:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:30,989 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-12-07 14:14:30,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:30,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-07 14:14:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:30,990 INFO L225 Difference]: With dead ends: 334 [2019-12-07 14:14:30,991 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 14:14:30,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:30,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 14:14:30,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 14:14:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 14:14:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-12-07 14:14:30,995 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-12-07 14:14:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:30,996 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-12-07 14:14:30,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-12-07 14:14:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 14:14:30,996 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:30,996 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:30,997 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:30,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:30,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2019-12-07 14:14:30,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:30,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205300579] [2019-12-07 14:14:30,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:14:31,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205300579] [2019-12-07 14:14:31,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:31,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:31,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245712909] [2019-12-07 14:14:31,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:31,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:31,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:31,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:31,029 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-12-07 14:14:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:31,240 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-12-07 14:14:31,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:31,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 14:14:31,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:31,241 INFO L225 Difference]: With dead ends: 324 [2019-12-07 14:14:31,241 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 14:14:31,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 14:14:31,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-12-07 14:14:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 14:14:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-12-07 14:14:31,246 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-12-07 14:14:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:31,246 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-12-07 14:14:31,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-12-07 14:14:31,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 14:14:31,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:31,247 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:31,247 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:31,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2019-12-07 14:14:31,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:31,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094736579] [2019-12-07 14:14:31,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:31,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094736579] [2019-12-07 14:14:31,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:31,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:31,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580791666] [2019-12-07 14:14:31,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:31,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:31,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:31,294 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-12-07 14:14:31,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:31,650 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-12-07 14:14:31,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:31,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 14:14:31,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:31,652 INFO L225 Difference]: With dead ends: 424 [2019-12-07 14:14:31,652 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 14:14:31,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 14:14:31,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-12-07 14:14:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-07 14:14:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-12-07 14:14:31,656 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-12-07 14:14:31,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:31,656 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-12-07 14:14:31,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-12-07 14:14:31,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 14:14:31,656 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:31,656 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:31,656 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:31,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:31,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2019-12-07 14:14:31,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:31,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966048763] [2019-12-07 14:14:31,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:31,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966048763] [2019-12-07 14:14:31,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:31,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:31,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967039100] [2019-12-07 14:14:31,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:31,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:31,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:31,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:31,698 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-12-07 14:14:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:31,972 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-12-07 14:14:31,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:31,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 14:14:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:31,973 INFO L225 Difference]: With dead ends: 427 [2019-12-07 14:14:31,973 INFO L226 Difference]: Without dead ends: 248 [2019-12-07 14:14:31,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-07 14:14:31,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-12-07 14:14:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-07 14:14:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-12-07 14:14:31,976 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-12-07 14:14:31,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:31,977 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-12-07 14:14:31,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:31,977 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-12-07 14:14:31,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:14:31,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:31,977 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:31,977 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:31,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:31,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2019-12-07 14:14:31,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:31,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279650323] [2019-12-07 14:14:31,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:32,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279650323] [2019-12-07 14:14:32,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:32,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:32,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099626838] [2019-12-07 14:14:32,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:32,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:32,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:32,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:32,022 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-12-07 14:14:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:32,300 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-12-07 14:14:32,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:32,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 14:14:32,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:32,301 INFO L225 Difference]: With dead ends: 494 [2019-12-07 14:14:32,301 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 14:14:32,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:32,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 14:14:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-12-07 14:14:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-12-07 14:14:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-12-07 14:14:32,305 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-12-07 14:14:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:32,306 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-12-07 14:14:32,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-12-07 14:14:32,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 14:14:32,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:32,306 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:32,306 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:32,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:32,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2019-12-07 14:14:32,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:32,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184394184] [2019-12-07 14:14:32,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:32,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184394184] [2019-12-07 14:14:32,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:32,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:32,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935191990] [2019-12-07 14:14:32,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:32,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:32,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:32,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:32,345 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-12-07 14:14:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:32,631 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-12-07 14:14:32,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:32,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 14:14:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:32,632 INFO L225 Difference]: With dead ends: 495 [2019-12-07 14:14:32,633 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 14:14:32,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 14:14:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-12-07 14:14:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-07 14:14:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-12-07 14:14:32,637 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-12-07 14:14:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:32,637 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-12-07 14:14:32,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-12-07 14:14:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 14:14:32,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:32,638 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:32,638 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:32,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:32,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2019-12-07 14:14:32,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:32,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71406931] [2019-12-07 14:14:32,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:32,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71406931] [2019-12-07 14:14:32,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:32,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:32,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831831440] [2019-12-07 14:14:32,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:32,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:32,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:32,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:32,690 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-12-07 14:14:32,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:32,950 INFO L93 Difference]: Finished difference Result 499 states and 772 transitions. [2019-12-07 14:14:32,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:32,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-12-07 14:14:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:32,952 INFO L225 Difference]: With dead ends: 499 [2019-12-07 14:14:32,952 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 14:14:32,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:32,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 14:14:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-12-07 14:14:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 14:14:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-12-07 14:14:32,956 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-12-07 14:14:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:32,956 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-12-07 14:14:32,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-12-07 14:14:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:14:32,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:32,956 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:32,957 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2019-12-07 14:14:32,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:32,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127166100] [2019-12-07 14:14:32,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:32,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127166100] [2019-12-07 14:14:32,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:32,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:32,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091009734] [2019-12-07 14:14:32,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:32,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:32,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:32,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:32,991 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-12-07 14:14:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:33,263 INFO L93 Difference]: Finished difference Result 500 states and 772 transitions. [2019-12-07 14:14:33,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:33,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 14:14:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:33,265 INFO L225 Difference]: With dead ends: 500 [2019-12-07 14:14:33,265 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 14:14:33,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 14:14:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-12-07 14:14:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 14:14:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-12-07 14:14:33,269 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-12-07 14:14:33,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:33,269 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-12-07 14:14:33,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:33,269 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-12-07 14:14:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:14:33,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:33,269 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:33,270 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:33,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:33,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2019-12-07 14:14:33,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:33,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860948400] [2019-12-07 14:14:33,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:33,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860948400] [2019-12-07 14:14:33,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:33,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:33,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839650627] [2019-12-07 14:14:33,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:33,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:33,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:33,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:33,307 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-12-07 14:14:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:33,542 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-12-07 14:14:33,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:33,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 14:14:33,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:33,544 INFO L225 Difference]: With dead ends: 475 [2019-12-07 14:14:33,545 INFO L226 Difference]: Without dead ends: 260 [2019-12-07 14:14:33,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:33,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-07 14:14:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-12-07 14:14:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 14:14:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-12-07 14:14:33,549 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-12-07 14:14:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:33,549 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-12-07 14:14:33,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-12-07 14:14:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 14:14:33,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:33,550 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:33,550 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:33,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:33,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2019-12-07 14:14:33,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:33,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697932367] [2019-12-07 14:14:33,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:33,585 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:33,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697932367] [2019-12-07 14:14:33,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:33,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:33,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635699588] [2019-12-07 14:14:33,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:33,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:33,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:33,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:33,586 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-12-07 14:14:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:33,879 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2019-12-07 14:14:33,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:33,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 14:14:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:33,881 INFO L225 Difference]: With dead ends: 499 [2019-12-07 14:14:33,881 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 14:14:33,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:33,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 14:14:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 234. [2019-12-07 14:14:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 14:14:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-12-07 14:14:33,886 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-12-07 14:14:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:33,886 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-12-07 14:14:33,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-12-07 14:14:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 14:14:33,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:33,887 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:33,887 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2019-12-07 14:14:33,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:33,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674971368] [2019-12-07 14:14:33,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:33,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674971368] [2019-12-07 14:14:33,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:33,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:33,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258265203] [2019-12-07 14:14:33,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:33,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:33,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:33,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:33,922 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-12-07 14:14:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:34,207 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-12-07 14:14:34,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:34,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 14:14:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:34,209 INFO L225 Difference]: With dead ends: 497 [2019-12-07 14:14:34,209 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 14:14:34,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:34,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 14:14:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-12-07 14:14:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 14:14:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-12-07 14:14:34,214 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-12-07 14:14:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:34,214 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-12-07 14:14:34,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-12-07 14:14:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 14:14:34,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:34,215 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-12-07 14:14:34,215 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:34,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2019-12-07 14:14:34,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:34,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232344650] [2019-12-07 14:14:34,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:34,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232344650] [2019-12-07 14:14:34,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:34,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:34,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391380154] [2019-12-07 14:14:34,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:34,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:34,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:34,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:34,248 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-12-07 14:14:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:34,550 INFO L93 Difference]: Finished difference Result 496 states and 760 transitions. [2019-12-07 14:14:34,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:34,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 14:14:34,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:34,552 INFO L225 Difference]: With dead ends: 496 [2019-12-07 14:14:34,552 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 14:14:34,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:34,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 14:14:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 234. [2019-12-07 14:14:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 14:14:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-12-07 14:14:34,557 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-12-07 14:14:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:34,557 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-12-07 14:14:34,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-12-07 14:14:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 14:14:34,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:34,558 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:34,558 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:34,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:34,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2019-12-07 14:14:34,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:34,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578623699] [2019-12-07 14:14:34,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 14:14:34,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578623699] [2019-12-07 14:14:34,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:34,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:14:34,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713205944] [2019-12-07 14:14:34,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:14:34,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:34,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:14:34,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:34,603 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-12-07 14:14:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:34,921 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-12-07 14:14:34,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:14:34,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-12-07 14:14:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:34,922 INFO L225 Difference]: With dead ends: 470 [2019-12-07 14:14:34,923 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 14:14:34,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:14:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 14:14:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-12-07 14:14:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 14:14:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-12-07 14:14:34,927 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-12-07 14:14:34,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:34,927 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-12-07 14:14:34,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:14:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-12-07 14:14:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 14:14:34,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:34,929 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:34,929 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:34,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:34,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2019-12-07 14:14:34,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:34,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969824822] [2019-12-07 14:14:34,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:34,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969824822] [2019-12-07 14:14:34,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:34,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:34,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824891183] [2019-12-07 14:14:34,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:34,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:34,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:34,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:34,968 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-12-07 14:14:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:35,191 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-12-07 14:14:35,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:35,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 14:14:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:35,192 INFO L225 Difference]: With dead ends: 512 [2019-12-07 14:14:35,192 INFO L226 Difference]: Without dead ends: 277 [2019-12-07 14:14:35,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:35,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-12-07 14:14:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-12-07 14:14:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 14:14:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-12-07 14:14:35,197 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-12-07 14:14:35,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:35,197 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-12-07 14:14:35,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-12-07 14:14:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 14:14:35,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:35,198 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-12-07 14:14:35,198 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:35,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:35,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2019-12-07 14:14:35,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:35,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413139467] [2019-12-07 14:14:35,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:35,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413139467] [2019-12-07 14:14:35,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:35,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:35,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084835831] [2019-12-07 14:14:35,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:35,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:35,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:35,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:35,229 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-12-07 14:14:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:35,449 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-12-07 14:14:35,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:35,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 14:14:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:35,451 INFO L225 Difference]: With dead ends: 511 [2019-12-07 14:14:35,451 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 14:14:35,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 14:14:35,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 14:14:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 14:14:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-12-07 14:14:35,455 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-12-07 14:14:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:35,455 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-12-07 14:14:35,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-12-07 14:14:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 14:14:35,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:35,456 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:35,456 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2019-12-07 14:14:35,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:35,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818430316] [2019-12-07 14:14:35,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:35,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818430316] [2019-12-07 14:14:35,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:35,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:35,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429027655] [2019-12-07 14:14:35,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:35,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:35,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:35,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:35,497 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-12-07 14:14:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:35,757 INFO L93 Difference]: Finished difference Result 536 states and 805 transitions. [2019-12-07 14:14:35,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:35,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 14:14:35,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:35,758 INFO L225 Difference]: With dead ends: 536 [2019-12-07 14:14:35,758 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 14:14:35,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:35,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 14:14:35,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-12-07 14:14:35,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 14:14:35,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-12-07 14:14:35,763 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-12-07 14:14:35,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:35,763 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-12-07 14:14:35,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-12-07 14:14:35,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 14:14:35,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:35,764 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:35,764 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:35,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:35,764 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2019-12-07 14:14:35,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:35,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684151577] [2019-12-07 14:14:35,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:35,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684151577] [2019-12-07 14:14:35,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:35,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:35,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850643580] [2019-12-07 14:14:35,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:35,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:35,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:35,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:35,797 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-12-07 14:14:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:36,021 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-12-07 14:14:36,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:36,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 14:14:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:36,023 INFO L225 Difference]: With dead ends: 511 [2019-12-07 14:14:36,023 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 14:14:36,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 14:14:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 14:14:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 14:14:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-12-07 14:14:36,027 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-12-07 14:14:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:36,027 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-12-07 14:14:36,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-12-07 14:14:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 14:14:36,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:36,028 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:36,028 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:36,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:36,028 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2019-12-07 14:14:36,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:36,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916001726] [2019-12-07 14:14:36,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:36,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916001726] [2019-12-07 14:14:36,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:36,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:36,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890261320] [2019-12-07 14:14:36,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:36,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:36,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:36,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:36,059 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-12-07 14:14:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:36,334 INFO L93 Difference]: Finished difference Result 536 states and 801 transitions. [2019-12-07 14:14:36,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:36,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-12-07 14:14:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:36,335 INFO L225 Difference]: With dead ends: 536 [2019-12-07 14:14:36,335 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 14:14:36,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 14:14:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-12-07 14:14:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 14:14:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-12-07 14:14:36,340 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-12-07 14:14:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:36,340 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-12-07 14:14:36,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-12-07 14:14:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 14:14:36,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:36,341 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:36,341 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:36,341 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2019-12-07 14:14:36,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:36,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594855200] [2019-12-07 14:14:36,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:36,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594855200] [2019-12-07 14:14:36,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:36,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:36,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815632473] [2019-12-07 14:14:36,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:36,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:36,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:36,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:36,373 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-12-07 14:14:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:36,594 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-12-07 14:14:36,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:36,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-12-07 14:14:36,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:36,595 INFO L225 Difference]: With dead ends: 511 [2019-12-07 14:14:36,596 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 14:14:36,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 14:14:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 14:14:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 14:14:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-12-07 14:14:36,600 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-12-07 14:14:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:36,600 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-12-07 14:14:36,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-12-07 14:14:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 14:14:36,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:36,600 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:36,600 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:36,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:36,601 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2019-12-07 14:14:36,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:36,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991153734] [2019-12-07 14:14:36,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:36,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991153734] [2019-12-07 14:14:36,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:36,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:36,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268023108] [2019-12-07 14:14:36,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:36,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:36,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:36,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:36,630 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-12-07 14:14:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:36,880 INFO L93 Difference]: Finished difference Result 536 states and 797 transitions. [2019-12-07 14:14:36,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:36,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-12-07 14:14:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:36,881 INFO L225 Difference]: With dead ends: 536 [2019-12-07 14:14:36,882 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 14:14:36,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 14:14:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-12-07 14:14:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 14:14:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-12-07 14:14:36,885 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-12-07 14:14:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:36,886 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-12-07 14:14:36,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-12-07 14:14:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 14:14:36,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:36,886 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:36,886 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:36,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:36,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2019-12-07 14:14:36,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:36,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361203099] [2019-12-07 14:14:36,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:36,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361203099] [2019-12-07 14:14:36,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:36,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:36,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497973422] [2019-12-07 14:14:36,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:36,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:36,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:36,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:36,918 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-12-07 14:14:37,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:37,133 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-12-07 14:14:37,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:37,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-12-07 14:14:37,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:37,135 INFO L225 Difference]: With dead ends: 511 [2019-12-07 14:14:37,135 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 14:14:37,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 14:14:37,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 14:14:37,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 14:14:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-12-07 14:14:37,139 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-12-07 14:14:37,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:37,140 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-12-07 14:14:37,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:37,140 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-12-07 14:14:37,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 14:14:37,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:37,141 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:37,141 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:37,141 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2019-12-07 14:14:37,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:37,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820382889] [2019-12-07 14:14:37,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:37,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820382889] [2019-12-07 14:14:37,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:37,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:37,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469200019] [2019-12-07 14:14:37,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:37,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:37,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:37,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:37,184 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-12-07 14:14:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:37,468 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2019-12-07 14:14:37,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:37,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-07 14:14:37,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:37,470 INFO L225 Difference]: With dead ends: 526 [2019-12-07 14:14:37,470 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 14:14:37,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:37,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 14:14:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-12-07 14:14:37,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 14:14:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-12-07 14:14:37,477 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-12-07 14:14:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:37,477 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-12-07 14:14:37,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-12-07 14:14:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 14:14:37,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:37,478 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:37,479 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:37,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2019-12-07 14:14:37,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:37,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093933829] [2019-12-07 14:14:37,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:37,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093933829] [2019-12-07 14:14:37,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:37,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:37,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914522618] [2019-12-07 14:14:37,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:37,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:37,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:37,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:37,529 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-12-07 14:14:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:37,742 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-12-07 14:14:37,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:37,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-07 14:14:37,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:37,744 INFO L225 Difference]: With dead ends: 501 [2019-12-07 14:14:37,744 INFO L226 Difference]: Without dead ends: 266 [2019-12-07 14:14:37,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-07 14:14:37,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-12-07 14:14:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 14:14:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-12-07 14:14:37,748 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-12-07 14:14:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:37,748 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-12-07 14:14:37,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-12-07 14:14:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 14:14:37,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:37,748 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:37,748 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:37,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:37,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2019-12-07 14:14:37,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:37,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945107071] [2019-12-07 14:14:37,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:14:37,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945107071] [2019-12-07 14:14:37,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:37,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:37,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809514846] [2019-12-07 14:14:37,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:37,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:37,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:37,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:37,780 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-12-07 14:14:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:38,016 INFO L93 Difference]: Finished difference Result 526 states and 777 transitions. [2019-12-07 14:14:38,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:38,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 14:14:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:38,018 INFO L225 Difference]: With dead ends: 526 [2019-12-07 14:14:38,018 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 14:14:38,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 14:14:38,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-12-07 14:14:38,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 14:14:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-12-07 14:14:38,022 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-12-07 14:14:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:38,022 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-12-07 14:14:38,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-12-07 14:14:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 14:14:38,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:38,023 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:38,023 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:38,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:38,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2019-12-07 14:14:38,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:38,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939303040] [2019-12-07 14:14:38,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 14:14:38,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939303040] [2019-12-07 14:14:38,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:38,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:14:38,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111232363] [2019-12-07 14:14:38,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:14:38,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:38,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:14:38,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:14:38,064 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-12-07 14:14:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:38,094 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-12-07 14:14:38,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:14:38,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-07 14:14:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:38,097 INFO L225 Difference]: With dead ends: 722 [2019-12-07 14:14:38,097 INFO L226 Difference]: Without dead ends: 487 [2019-12-07 14:14:38,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:14:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-07 14:14:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-12-07 14:14:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-12-07 14:14:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-12-07 14:14:38,104 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-12-07 14:14:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:38,105 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-12-07 14:14:38,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:14:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-12-07 14:14:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:14:38,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:38,105 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:38,105 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:38,106 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2019-12-07 14:14:38,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:38,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133705806] [2019-12-07 14:14:38,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:14:38,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133705806] [2019-12-07 14:14:38,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:38,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:14:38,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609662127] [2019-12-07 14:14:38,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:14:38,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:38,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:14:38,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:14:38,135 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-12-07 14:14:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:38,176 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-12-07 14:14:38,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:14:38,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 14:14:38,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:38,179 INFO L225 Difference]: With dead ends: 1190 [2019-12-07 14:14:38,180 INFO L226 Difference]: Without dead ends: 722 [2019-12-07 14:14:38,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:14:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-12-07 14:14:38,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-12-07 14:14:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 14:14:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-12-07 14:14:38,193 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-12-07 14:14:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:38,193 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-12-07 14:14:38,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:14:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-12-07 14:14:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 14:14:38,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:38,194 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:38,194 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:38,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:38,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2019-12-07 14:14:38,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:38,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953301153] [2019-12-07 14:14:38,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:14:38,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953301153] [2019-12-07 14:14:38,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:38,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:14:38,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697489692] [2019-12-07 14:14:38,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:14:38,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:38,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:14:38,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:14:38,222 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-12-07 14:14:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:38,277 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-12-07 14:14:38,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:14:38,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 14:14:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:38,282 INFO L225 Difference]: With dead ends: 1656 [2019-12-07 14:14:38,282 INFO L226 Difference]: Without dead ends: 955 [2019-12-07 14:14:38,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:14:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-12-07 14:14:38,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-12-07 14:14:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-12-07 14:14:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-12-07 14:14:38,302 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-12-07 14:14:38,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:38,303 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-12-07 14:14:38,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:14:38,303 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-12-07 14:14:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 14:14:38,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:38,304 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:38,305 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:38,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:38,305 INFO L82 PathProgramCache]: Analyzing trace with hash -796142130, now seen corresponding path program 1 times [2019-12-07 14:14:38,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:38,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241684397] [2019-12-07 14:14:38,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:14:38,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241684397] [2019-12-07 14:14:38,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:38,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:14:38,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221943700] [2019-12-07 14:14:38,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:14:38,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:38,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:14:38,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:14:38,340 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-12-07 14:14:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:38,379 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-12-07 14:14:38,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:14:38,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 14:14:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:38,383 INFO L225 Difference]: With dead ends: 2120 [2019-12-07 14:14:38,383 INFO L226 Difference]: Without dead ends: 1186 [2019-12-07 14:14:38,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:14:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-12-07 14:14:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-12-07 14:14:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-12-07 14:14:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-12-07 14:14:38,401 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-12-07 14:14:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:38,401 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-12-07 14:14:38,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:14:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-12-07 14:14:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 14:14:38,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:38,403 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:38,403 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:38,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:38,403 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2019-12-07 14:14:38,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:38,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423045730] [2019-12-07 14:14:38,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:14:38,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423045730] [2019-12-07 14:14:38,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:38,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:14:38,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71618267] [2019-12-07 14:14:38,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:14:38,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:38,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:14:38,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:14:38,437 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-12-07 14:14:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:38,476 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-12-07 14:14:38,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:14:38,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-12-07 14:14:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:38,481 INFO L225 Difference]: With dead ends: 1423 [2019-12-07 14:14:38,481 INFO L226 Difference]: Without dead ends: 1421 [2019-12-07 14:14:38,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:14:38,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-12-07 14:14:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-12-07 14:14:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-07 14:14:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-12-07 14:14:38,502 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-12-07 14:14:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:38,502 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-12-07 14:14:38,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:14:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-12-07 14:14:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 14:14:38,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:38,504 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:38,504 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:38,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:38,504 INFO L82 PathProgramCache]: Analyzing trace with hash -618148538, now seen corresponding path program 1 times [2019-12-07 14:14:38,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:38,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011307199] [2019-12-07 14:14:38,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-07 14:14:38,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011307199] [2019-12-07 14:14:38,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:38,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:14:38,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220626609] [2019-12-07 14:14:38,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:14:38,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:38,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:14:38,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:14:38,553 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 3 states. [2019-12-07 14:14:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:38,613 INFO L93 Difference]: Finished difference Result 2120 states and 3120 transitions. [2019-12-07 14:14:38,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:14:38,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-12-07 14:14:38,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:38,619 INFO L225 Difference]: With dead ends: 2120 [2019-12-07 14:14:38,619 INFO L226 Difference]: Without dead ends: 1652 [2019-12-07 14:14:38,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:14:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2019-12-07 14:14:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1652. [2019-12-07 14:14:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-12-07 14:14:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2432 transitions. [2019-12-07 14:14:38,642 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2432 transitions. Word has length 164 [2019-12-07 14:14:38,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:38,642 INFO L462 AbstractCegarLoop]: Abstraction has 1652 states and 2432 transitions. [2019-12-07 14:14:38,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:14:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2432 transitions. [2019-12-07 14:14:38,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 14:14:38,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:38,644 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:38,644 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:38,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:38,644 INFO L82 PathProgramCache]: Analyzing trace with hash 383929993, now seen corresponding path program 1 times [2019-12-07 14:14:38,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:38,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615071352] [2019-12-07 14:14:38,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:14:38,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615071352] [2019-12-07 14:14:38,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:38,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:38,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33415070] [2019-12-07 14:14:38,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:38,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:38,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:38,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:38,694 INFO L87 Difference]: Start difference. First operand 1652 states and 2432 transitions. Second operand 4 states. [2019-12-07 14:14:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:38,977 INFO L93 Difference]: Finished difference Result 3726 states and 5519 transitions. [2019-12-07 14:14:38,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:38,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-12-07 14:14:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:38,985 INFO L225 Difference]: With dead ends: 3726 [2019-12-07 14:14:38,985 INFO L226 Difference]: Without dead ends: 2093 [2019-12-07 14:14:38,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2019-12-07 14:14:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1848. [2019-12-07 14:14:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-12-07 14:14:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2775 transitions. [2019-12-07 14:14:39,011 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2775 transitions. Word has length 172 [2019-12-07 14:14:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:39,012 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2775 transitions. [2019-12-07 14:14:39,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2775 transitions. [2019-12-07 14:14:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 14:14:39,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:39,013 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:39,014 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:39,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:39,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1861094142, now seen corresponding path program 1 times [2019-12-07 14:14:39,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:39,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850856575] [2019-12-07 14:14:39,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:14:39,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850856575] [2019-12-07 14:14:39,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:39,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:39,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163608799] [2019-12-07 14:14:39,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:39,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:39,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:39,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:39,062 INFO L87 Difference]: Start difference. First operand 1848 states and 2775 transitions. Second operand 4 states. [2019-12-07 14:14:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:39,339 INFO L93 Difference]: Finished difference Result 3922 states and 5855 transitions. [2019-12-07 14:14:39,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:39,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-12-07 14:14:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:39,348 INFO L225 Difference]: With dead ends: 3922 [2019-12-07 14:14:39,348 INFO L226 Difference]: Without dead ends: 2093 [2019-12-07 14:14:39,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2019-12-07 14:14:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1848. [2019-12-07 14:14:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-12-07 14:14:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2768 transitions. [2019-12-07 14:14:39,376 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2768 transitions. Word has length 185 [2019-12-07 14:14:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:39,376 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2768 transitions. [2019-12-07 14:14:39,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2768 transitions. [2019-12-07 14:14:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 14:14:39,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:39,378 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:39,378 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:39,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash 593014019, now seen corresponding path program 1 times [2019-12-07 14:14:39,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:39,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699898127] [2019-12-07 14:14:39,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:14:39,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699898127] [2019-12-07 14:14:39,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:39,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:39,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280608518] [2019-12-07 14:14:39,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:39,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:39,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:39,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:39,428 INFO L87 Difference]: Start difference. First operand 1848 states and 2768 transitions. Second operand 4 states. [2019-12-07 14:14:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:39,689 INFO L93 Difference]: Finished difference Result 3908 states and 5827 transitions. [2019-12-07 14:14:39,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:39,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-12-07 14:14:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:39,696 INFO L225 Difference]: With dead ends: 3908 [2019-12-07 14:14:39,696 INFO L226 Difference]: Without dead ends: 2079 [2019-12-07 14:14:39,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:39,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2019-12-07 14:14:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1848. [2019-12-07 14:14:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-12-07 14:14:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2761 transitions. [2019-12-07 14:14:39,723 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2761 transitions. Word has length 186 [2019-12-07 14:14:39,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:39,723 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2761 transitions. [2019-12-07 14:14:39,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2761 transitions. [2019-12-07 14:14:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 14:14:39,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:39,725 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:39,725 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:39,726 INFO L82 PathProgramCache]: Analyzing trace with hash -699433533, now seen corresponding path program 1 times [2019-12-07 14:14:39,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:39,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785129891] [2019-12-07 14:14:39,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:14:39,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785129891] [2019-12-07 14:14:39,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:39,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:39,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372647101] [2019-12-07 14:14:39,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:39,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:39,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:39,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:39,780 INFO L87 Difference]: Start difference. First operand 1848 states and 2761 transitions. Second operand 4 states. [2019-12-07 14:14:40,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:40,040 INFO L93 Difference]: Finished difference Result 3901 states and 5806 transitions. [2019-12-07 14:14:40,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:40,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-12-07 14:14:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:40,047 INFO L225 Difference]: With dead ends: 3901 [2019-12-07 14:14:40,047 INFO L226 Difference]: Without dead ends: 2072 [2019-12-07 14:14:40,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-12-07 14:14:40,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-12-07 14:14:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-12-07 14:14:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2754 transitions. [2019-12-07 14:14:40,074 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2754 transitions. Word has length 186 [2019-12-07 14:14:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:40,074 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2754 transitions. [2019-12-07 14:14:40,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2754 transitions. [2019-12-07 14:14:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-12-07 14:14:40,076 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:40,076 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:40,076 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:40,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1460921410, now seen corresponding path program 1 times [2019-12-07 14:14:40,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:40,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846899582] [2019-12-07 14:14:40,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:14:40,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846899582] [2019-12-07 14:14:40,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:40,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:40,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694042215] [2019-12-07 14:14:40,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:40,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:40,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:40,126 INFO L87 Difference]: Start difference. First operand 1848 states and 2754 transitions. Second operand 4 states. [2019-12-07 14:14:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:40,390 INFO L93 Difference]: Finished difference Result 3901 states and 5792 transitions. [2019-12-07 14:14:40,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:40,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-12-07 14:14:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:40,397 INFO L225 Difference]: With dead ends: 3901 [2019-12-07 14:14:40,397 INFO L226 Difference]: Without dead ends: 2072 [2019-12-07 14:14:40,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-12-07 14:14:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-12-07 14:14:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-12-07 14:14:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2747 transitions. [2019-12-07 14:14:40,424 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2747 transitions. Word has length 187 [2019-12-07 14:14:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:40,424 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2747 transitions. [2019-12-07 14:14:40,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2747 transitions. [2019-12-07 14:14:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-07 14:14:40,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:40,426 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:40,426 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:40,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:40,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1574944825, now seen corresponding path program 1 times [2019-12-07 14:14:40,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:40,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599509549] [2019-12-07 14:14:40,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:14:40,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599509549] [2019-12-07 14:14:40,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:40,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:40,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004756713] [2019-12-07 14:14:40,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:40,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:40,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:40,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:40,473 INFO L87 Difference]: Start difference. First operand 1848 states and 2747 transitions. Second operand 4 states. [2019-12-07 14:14:40,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:40,763 INFO L93 Difference]: Finished difference Result 3901 states and 5778 transitions. [2019-12-07 14:14:40,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:40,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-12-07 14:14:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:40,772 INFO L225 Difference]: With dead ends: 3901 [2019-12-07 14:14:40,772 INFO L226 Difference]: Without dead ends: 2072 [2019-12-07 14:14:40,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-12-07 14:14:40,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-12-07 14:14:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-12-07 14:14:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2740 transitions. [2019-12-07 14:14:40,800 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2740 transitions. Word has length 188 [2019-12-07 14:14:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:40,800 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2740 transitions. [2019-12-07 14:14:40,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2740 transitions. [2019-12-07 14:14:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-07 14:14:40,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:40,802 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:40,802 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:40,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:40,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1346205799, now seen corresponding path program 1 times [2019-12-07 14:14:40,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:40,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787209978] [2019-12-07 14:14:40,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:14:40,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787209978] [2019-12-07 14:14:40,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:40,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:40,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671360005] [2019-12-07 14:14:40,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:40,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:40,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:40,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:40,852 INFO L87 Difference]: Start difference. First operand 1848 states and 2740 transitions. Second operand 4 states. [2019-12-07 14:14:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:41,101 INFO L93 Difference]: Finished difference Result 3901 states and 5764 transitions. [2019-12-07 14:14:41,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:41,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-12-07 14:14:41,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:41,105 INFO L225 Difference]: With dead ends: 3901 [2019-12-07 14:14:41,105 INFO L226 Difference]: Without dead ends: 2072 [2019-12-07 14:14:41,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-12-07 14:14:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-12-07 14:14:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-12-07 14:14:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2733 transitions. [2019-12-07 14:14:41,134 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2733 transitions. Word has length 189 [2019-12-07 14:14:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:41,135 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2733 transitions. [2019-12-07 14:14:41,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2733 transitions. [2019-12-07 14:14:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-07 14:14:41,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:41,136 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:41,137 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:41,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:41,137 INFO L82 PathProgramCache]: Analyzing trace with hash -43681972, now seen corresponding path program 1 times [2019-12-07 14:14:41,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:41,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818978674] [2019-12-07 14:14:41,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:14:41,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818978674] [2019-12-07 14:14:41,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:41,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:41,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336961330] [2019-12-07 14:14:41,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:41,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:41,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:41,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:41,198 INFO L87 Difference]: Start difference. First operand 1848 states and 2733 transitions. Second operand 4 states. [2019-12-07 14:14:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:41,657 INFO L93 Difference]: Finished difference Result 3831 states and 5666 transitions. [2019-12-07 14:14:41,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:41,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-12-07 14:14:41,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:41,661 INFO L225 Difference]: With dead ends: 3831 [2019-12-07 14:14:41,661 INFO L226 Difference]: Without dead ends: 2002 [2019-12-07 14:14:41,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-12-07 14:14:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-12-07 14:14:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-12-07 14:14:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2726 transitions. [2019-12-07 14:14:41,687 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2726 transitions. Word has length 190 [2019-12-07 14:14:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:41,688 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2726 transitions. [2019-12-07 14:14:41,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2726 transitions. [2019-12-07 14:14:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-12-07 14:14:41,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:41,690 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:41,690 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:41,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:41,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1447453746, now seen corresponding path program 1 times [2019-12-07 14:14:41,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:41,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211607693] [2019-12-07 14:14:41,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:14:41,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211607693] [2019-12-07 14:14:41,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:41,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:41,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679000622] [2019-12-07 14:14:41,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:41,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:41,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:41,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:41,748 INFO L87 Difference]: Start difference. First operand 1848 states and 2726 transitions. Second operand 4 states. [2019-12-07 14:14:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:42,005 INFO L93 Difference]: Finished difference Result 3831 states and 5652 transitions. [2019-12-07 14:14:42,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:42,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-12-07 14:14:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:42,008 INFO L225 Difference]: With dead ends: 3831 [2019-12-07 14:14:42,008 INFO L226 Difference]: Without dead ends: 2002 [2019-12-07 14:14:42,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-12-07 14:14:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-12-07 14:14:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-12-07 14:14:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2719 transitions. [2019-12-07 14:14:42,033 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2719 transitions. Word has length 194 [2019-12-07 14:14:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:42,033 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2719 transitions. [2019-12-07 14:14:42,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2719 transitions. [2019-12-07 14:14:42,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-12-07 14:14:42,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:42,035 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:42,035 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:42,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:42,035 INFO L82 PathProgramCache]: Analyzing trace with hash 161862790, now seen corresponding path program 1 times [2019-12-07 14:14:42,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:42,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686337836] [2019-12-07 14:14:42,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:14:42,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686337836] [2019-12-07 14:14:42,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:42,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:42,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696202191] [2019-12-07 14:14:42,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:42,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:42,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:42,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:42,088 INFO L87 Difference]: Start difference. First operand 1848 states and 2719 transitions. Second operand 4 states. [2019-12-07 14:14:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:42,335 INFO L93 Difference]: Finished difference Result 3831 states and 5638 transitions. [2019-12-07 14:14:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:42,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-12-07 14:14:42,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:42,338 INFO L225 Difference]: With dead ends: 3831 [2019-12-07 14:14:42,338 INFO L226 Difference]: Without dead ends: 2002 [2019-12-07 14:14:42,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-12-07 14:14:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-12-07 14:14:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-12-07 14:14:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2712 transitions. [2019-12-07 14:14:42,363 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2712 transitions. Word has length 194 [2019-12-07 14:14:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:42,363 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2712 transitions. [2019-12-07 14:14:42,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2712 transitions. [2019-12-07 14:14:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-12-07 14:14:42,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:42,365 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:42,366 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:42,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:42,366 INFO L82 PathProgramCache]: Analyzing trace with hash -345495059, now seen corresponding path program 1 times [2019-12-07 14:14:42,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:42,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692759046] [2019-12-07 14:14:42,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:14:42,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692759046] [2019-12-07 14:14:42,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:42,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:42,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615398833] [2019-12-07 14:14:42,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:42,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:42,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:42,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:42,418 INFO L87 Difference]: Start difference. First operand 1848 states and 2712 transitions. Second operand 4 states. [2019-12-07 14:14:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:42,677 INFO L93 Difference]: Finished difference Result 3803 states and 5585 transitions. [2019-12-07 14:14:42,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:42,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-12-07 14:14:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:42,679 INFO L225 Difference]: With dead ends: 3803 [2019-12-07 14:14:42,679 INFO L226 Difference]: Without dead ends: 1974 [2019-12-07 14:14:42,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-12-07 14:14:42,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1848. [2019-12-07 14:14:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-12-07 14:14:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2705 transitions. [2019-12-07 14:14:42,711 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2705 transitions. Word has length 195 [2019-12-07 14:14:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:42,711 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2705 transitions. [2019-12-07 14:14:42,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2705 transitions. [2019-12-07 14:14:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-12-07 14:14:42,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:42,714 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:42,714 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:42,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:42,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1457997217, now seen corresponding path program 1 times [2019-12-07 14:14:42,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:42,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615921424] [2019-12-07 14:14:42,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:14:42,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615921424] [2019-12-07 14:14:42,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:42,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:42,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343203850] [2019-12-07 14:14:42,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:42,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:42,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:42,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:42,791 INFO L87 Difference]: Start difference. First operand 1848 states and 2705 transitions. Second operand 4 states. [2019-12-07 14:14:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:43,046 INFO L93 Difference]: Finished difference Result 3768 states and 5525 transitions. [2019-12-07 14:14:43,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:43,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-12-07 14:14:43,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:43,049 INFO L225 Difference]: With dead ends: 3768 [2019-12-07 14:14:43,049 INFO L226 Difference]: Without dead ends: 1939 [2019-12-07 14:14:43,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-07 14:14:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1848. [2019-12-07 14:14:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-12-07 14:14:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2698 transitions. [2019-12-07 14:14:43,075 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2698 transitions. Word has length 195 [2019-12-07 14:14:43,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:43,075 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2698 transitions. [2019-12-07 14:14:43,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2698 transitions. [2019-12-07 14:14:43,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-12-07 14:14:43,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:43,077 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:43,078 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:43,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:43,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2120220672, now seen corresponding path program 1 times [2019-12-07 14:14:43,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:43,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848123306] [2019-12-07 14:14:43,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:14:43,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848123306] [2019-12-07 14:14:43,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:43,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:14:43,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331548912] [2019-12-07 14:14:43,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:14:43,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:43,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:14:43,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:14:43,138 INFO L87 Difference]: Start difference. First operand 1848 states and 2698 transitions. Second operand 4 states. [2019-12-07 14:14:43,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:43,420 INFO L93 Difference]: Finished difference Result 4146 states and 6093 transitions. [2019-12-07 14:14:43,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:14:43,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-12-07 14:14:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:43,422 INFO L225 Difference]: With dead ends: 4146 [2019-12-07 14:14:43,422 INFO L226 Difference]: Without dead ends: 2317 [2019-12-07 14:14:43,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2019-12-07 14:14:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2058. [2019-12-07 14:14:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-12-07 14:14:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 3069 transitions. [2019-12-07 14:14:43,450 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 3069 transitions. Word has length 197 [2019-12-07 14:14:43,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:43,450 INFO L462 AbstractCegarLoop]: Abstraction has 2058 states and 3069 transitions. [2019-12-07 14:14:43,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:14:43,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 3069 transitions. [2019-12-07 14:14:43,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-12-07 14:14:43,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:43,453 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:43,453 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:43,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:43,453 INFO L82 PathProgramCache]: Analyzing trace with hash 650332099, now seen corresponding path program 1 times [2019-12-07 14:14:43,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:43,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675278989] [2019-12-07 14:14:43,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:14:43,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675278989] [2019-12-07 14:14:43,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:14:43,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:14:43,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144792010] [2019-12-07 14:14:43,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:14:43,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:43,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:14:43,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:14:43,572 INFO L87 Difference]: Start difference. First operand 2058 states and 3069 transitions. Second operand 5 states. [2019-12-07 14:14:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:14:44,044 INFO L93 Difference]: Finished difference Result 4636 states and 6940 transitions. [2019-12-07 14:14:44,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:14:44,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-12-07 14:14:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:14:44,046 INFO L225 Difference]: With dead ends: 4636 [2019-12-07 14:14:44,046 INFO L226 Difference]: Without dead ends: 2597 [2019-12-07 14:14:44,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:14:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2019-12-07 14:14:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2289. [2019-12-07 14:14:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2289 states. [2019-12-07 14:14:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 2289 states and 3482 transitions. [2019-12-07 14:14:44,077 INFO L78 Accepts]: Start accepts. Automaton has 2289 states and 3482 transitions. Word has length 203 [2019-12-07 14:14:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:14:44,078 INFO L462 AbstractCegarLoop]: Abstraction has 2289 states and 3482 transitions. [2019-12-07 14:14:44,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:14:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 3482 transitions. [2019-12-07 14:14:44,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-12-07 14:14:44,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:14:44,080 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:14:44,080 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:14:44,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:14:44,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1414950854, now seen corresponding path program 1 times [2019-12-07 14:14:44,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:14:44,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741589914] [2019-12-07 14:14:44,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:14:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 235 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 14:14:44,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741589914] [2019-12-07 14:14:44,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044795804] [2019-12-07 14:14:44,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:14:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:14:44,411 INFO L264 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 14:14:44,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:14:44,486 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:44,486 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 27 treesize of output 31 [2019-12-07 14:14:44,487 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:44,514 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-12-07 14:14:44,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:44,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:44,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:44,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:44,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:44,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:44,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 14:14:44,542 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,560 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:44,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:44,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:44,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:44,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:44,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:44,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:44,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:14:44,571 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,584 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:44,605 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:14:44,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:14:44,606 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:44,615 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,615 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 14:14:44,653 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:14:44,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:14:44,654 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,659 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:44,659 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,659 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:14:44,682 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:14:44,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:14:44,683 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:44,703 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,703 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:14:44,706 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-12-07 14:14:44,709 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:14:44,719 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:44,754 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 14:14:44,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 14:14:44,755 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:44,762 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,762 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 14:14:44,794 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:14:44,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:14:44,795 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:44,802 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,802 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:14:44,823 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:14:44,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:14:44,823 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,829 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:44,829 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:14:44,829 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:14:44,836 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-12-07 14:14:44,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:44,840 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 49 treesize of output 37 [2019-12-07 14:14:44,840 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:14:44,849 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:44,964 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-12-07 14:14:44,965 INFO L343 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-12-07 14:14:44,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-12-07 14:14:44,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:44,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:44,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:44,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:44,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:44,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:44,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:44,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:44,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:44,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:45,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:45,328 INFO L534 ElimStorePlain]: Start of recursive call 3: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 3 xjuncts. [2019-12-07 14:14:46,655 WARN L192 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 481 DAG size of output: 288 [2019-12-07 14:14:46,656 INFO L614 ElimStorePlain]: treesize reduction 3372, result has 33.0 percent of original size [2019-12-07 14:14:46,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:46,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 14:14:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:46,675 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 44 dim-0 vars, and 3 xjuncts. [2019-12-07 14:14:46,676 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:2111 [2019-12-07 14:14:50,452 WARN L192 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 347 DAG size of output: 35 [2019-12-07 14:14:50,456 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-12-07 14:14:50,458 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:14:50,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:50,595 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2019-12-07 14:14:50,595 INFO L343 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-12-07 14:14:50,596 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2019-12-07 14:14:50,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:50,597 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:50,625 INFO L614 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-12-07 14:14:50,625 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:14:50,625 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-12-07 14:14:50,645 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 30=[|v_#memory_$Pointer$.base_170|]} [2019-12-07 14:14:50,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:14:50,649 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:50,664 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:50,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:50,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:50,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:50,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:50,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:50,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:50,767 INFO L343 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2019-12-07 14:14:50,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 207 [2019-12-07 14:14:50,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:50,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:50,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:50,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:50,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:50,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:50,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:50,772 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:50,903 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 40 [2019-12-07 14:14:50,904 INFO L614 ElimStorePlain]: treesize reduction 7769, result has 1.1 percent of original size [2019-12-07 14:14:50,904 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:14:50,904 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2019-12-07 14:14:50,933 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_179|], 20=[|v_#memory_$Pointer$.base_171|]} [2019-12-07 14:14:50,936 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 31 treesize of output 25 [2019-12-07 14:14:50,936 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:14:50,948 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:50,951 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-12-07 14:14:50,951 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:50,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:50,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:50,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:50,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:14:50,998 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:50,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-12-07 14:14:50,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:50,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:50,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:50,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:51,054 INFO L534 ElimStorePlain]: Start of recursive call 4: 125 dim-0 vars, End of recursive call: 125 dim-0 vars, and 16 xjuncts. [2019-12-07 14:14:53,575 WARN L192 SmtUtils]: Spent 2.52 s on a formula simplification that was a NOOP. DAG size: 1002 [2019-12-07 14:14:53,575 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:53,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:14:53,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 14:14:53,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:14:53,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:14:53,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:53,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:53,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-12-07 14:14:53,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 14:14:53,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:14:53,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 14:14:53,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:14:53,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:53,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 14:14:53,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:14:53,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:14:53,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 14:14:53,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 14:14:53,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:14:53,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:14:53,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:14:53,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:14:53,623 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 250 dim-0 vars, and 1 xjuncts. [2019-12-07 14:14:53,624 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:1761 [2019-12-07 14:14:54,525 WARN L192 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 1263 DAG size of output: 22 [2019-12-07 14:14:54,534 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:14:54,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-12-07 14:14:54,534 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:54,539 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:54,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:14:54,539 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-12-07 14:14:54,573 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:14:54,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-12-07 14:14:54,574 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:14:54,577 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:14:54,577 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:14:54,577 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-12-07 14:14:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 199 proven. 102 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:14:54,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:14:54,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-12-07 14:14:54,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422488995] [2019-12-07 14:14:54,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 14:14:54,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:14:54,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 14:14:54,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:14:54,828 INFO L87 Difference]: Start difference. First operand 2289 states and 3482 transitions. Second operand 16 states. [2019-12-07 14:15:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:00,067 INFO L93 Difference]: Finished difference Result 14824 states and 22594 transitions. [2019-12-07 14:15:00,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-07 14:15:00,068 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 208 [2019-12-07 14:15:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:00,081 INFO L225 Difference]: With dead ends: 14824 [2019-12-07 14:15:00,081 INFO L226 Difference]: Without dead ends: 12554 [2019-12-07 14:15:00,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=496, Invalid=2474, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 14:15:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12554 states. [2019-12-07 14:15:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12554 to 8092. [2019-12-07 14:15:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8092 states. [2019-12-07 14:15:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8092 states to 8092 states and 13072 transitions. [2019-12-07 14:15:00,250 INFO L78 Accepts]: Start accepts. Automaton has 8092 states and 13072 transitions. Word has length 208 [2019-12-07 14:15:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:00,251 INFO L462 AbstractCegarLoop]: Abstraction has 8092 states and 13072 transitions. [2019-12-07 14:15:00,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 14:15:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 8092 states and 13072 transitions. [2019-12-07 14:15:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-12-07 14:15:00,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:00,265 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:00,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:00,466 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:00,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:00,466 INFO L82 PathProgramCache]: Analyzing trace with hash 79355886, now seen corresponding path program 1 times [2019-12-07 14:15:00,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:00,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60164426] [2019-12-07 14:15:00,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-07 14:15:00,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60164426] [2019-12-07 14:15:00,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:00,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:15:00,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193721192] [2019-12-07 14:15:00,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:15:00,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:00,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:15:00,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:15:00,629 INFO L87 Difference]: Start difference. First operand 8092 states and 13072 transitions. Second operand 7 states. [2019-12-07 14:15:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:02,399 INFO L93 Difference]: Finished difference Result 24830 states and 39613 transitions. [2019-12-07 14:15:02,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:15:02,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 209 [2019-12-07 14:15:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:02,420 INFO L225 Difference]: With dead ends: 24830 [2019-12-07 14:15:02,420 INFO L226 Difference]: Without dead ends: 16687 [2019-12-07 14:15:02,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:15:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16687 states. [2019-12-07 14:15:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16687 to 9520. [2019-12-07 14:15:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15648 transitions. [2019-12-07 14:15:02,624 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15648 transitions. Word has length 209 [2019-12-07 14:15:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:02,624 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15648 transitions. [2019-12-07 14:15:02,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:15:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15648 transitions. [2019-12-07 14:15:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-12-07 14:15:02,632 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:02,632 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:02,632 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:02,632 INFO L82 PathProgramCache]: Analyzing trace with hash 836137251, now seen corresponding path program 1 times [2019-12-07 14:15:02,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:02,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498151114] [2019-12-07 14:15:02,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-07 14:15:02,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498151114] [2019-12-07 14:15:02,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:02,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:02,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254725529] [2019-12-07 14:15:02,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:02,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:02,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:02,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:02,690 INFO L87 Difference]: Start difference. First operand 9520 states and 15648 transitions. Second operand 4 states. [2019-12-07 14:15:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:03,057 INFO L93 Difference]: Finished difference Result 19203 states and 31548 transitions. [2019-12-07 14:15:03,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:03,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-12-07 14:15:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:03,065 INFO L225 Difference]: With dead ends: 19203 [2019-12-07 14:15:03,065 INFO L226 Difference]: Without dead ends: 9702 [2019-12-07 14:15:03,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9702 states. [2019-12-07 14:15:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9702 to 9520. [2019-12-07 14:15:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15634 transitions. [2019-12-07 14:15:03,248 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15634 transitions. Word has length 212 [2019-12-07 14:15:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:03,248 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15634 transitions. [2019-12-07 14:15:03,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15634 transitions. [2019-12-07 14:15:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-12-07 14:15:03,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:03,256 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:03,256 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:03,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash 932670371, now seen corresponding path program 1 times [2019-12-07 14:15:03,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:03,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657487369] [2019-12-07 14:15:03,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-07 14:15:03,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657487369] [2019-12-07 14:15:03,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:03,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:03,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090377705] [2019-12-07 14:15:03,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:03,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:03,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:03,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:03,322 INFO L87 Difference]: Start difference. First operand 9520 states and 15634 transitions. Second operand 4 states. [2019-12-07 14:15:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:03,693 INFO L93 Difference]: Finished difference Result 19203 states and 31520 transitions. [2019-12-07 14:15:03,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:03,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-12-07 14:15:03,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:03,701 INFO L225 Difference]: With dead ends: 19203 [2019-12-07 14:15:03,701 INFO L226 Difference]: Without dead ends: 9702 [2019-12-07 14:15:03,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9702 states. [2019-12-07 14:15:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9702 to 9520. [2019-12-07 14:15:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15620 transitions. [2019-12-07 14:15:03,857 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15620 transitions. Word has length 213 [2019-12-07 14:15:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:03,857 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15620 transitions. [2019-12-07 14:15:03,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15620 transitions. [2019-12-07 14:15:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-12-07 14:15:03,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:03,865 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:03,865 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:03,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1303373159, now seen corresponding path program 1 times [2019-12-07 14:15:03,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:03,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713292524] [2019-12-07 14:15:03,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:15:03,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713292524] [2019-12-07 14:15:03,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:03,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:03,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073041355] [2019-12-07 14:15:03,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:03,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:03,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:03,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:03,924 INFO L87 Difference]: Start difference. First operand 9520 states and 15620 transitions. Second operand 4 states. [2019-12-07 14:15:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:04,342 INFO L93 Difference]: Finished difference Result 13806 states and 22513 transitions. [2019-12-07 14:15:04,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:04,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-12-07 14:15:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:04,349 INFO L225 Difference]: With dead ends: 13806 [2019-12-07 14:15:04,349 INFO L226 Difference]: Without dead ends: 9968 [2019-12-07 14:15:04,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9968 states. [2019-12-07 14:15:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9968 to 9520. [2019-12-07 14:15:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15606 transitions. [2019-12-07 14:15:04,523 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15606 transitions. Word has length 213 [2019-12-07 14:15:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:04,523 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15606 transitions. [2019-12-07 14:15:04,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15606 transitions. [2019-12-07 14:15:04,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-12-07 14:15:04,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:04,528 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:04,528 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:04,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:04,528 INFO L82 PathProgramCache]: Analyzing trace with hash 989195624, now seen corresponding path program 1 times [2019-12-07 14:15:04,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:04,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006137899] [2019-12-07 14:15:04,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-07 14:15:04,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006137899] [2019-12-07 14:15:04,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:04,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:04,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604914754] [2019-12-07 14:15:04,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:04,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:04,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:04,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:04,592 INFO L87 Difference]: Start difference. First operand 9520 states and 15606 transitions. Second operand 4 states. [2019-12-07 14:15:04,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:04,937 INFO L93 Difference]: Finished difference Result 19161 states and 31414 transitions. [2019-12-07 14:15:04,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:04,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-12-07 14:15:04,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:04,945 INFO L225 Difference]: With dead ends: 19161 [2019-12-07 14:15:04,945 INFO L226 Difference]: Without dead ends: 9660 [2019-12-07 14:15:04,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:04,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9660 states. [2019-12-07 14:15:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9660 to 9520. [2019-12-07 14:15:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15592 transitions. [2019-12-07 14:15:05,101 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15592 transitions. Word has length 214 [2019-12-07 14:15:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:05,101 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15592 transitions. [2019-12-07 14:15:05,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15592 transitions. [2019-12-07 14:15:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-12-07 14:15:05,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:05,106 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:05,106 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:05,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:05,106 INFO L82 PathProgramCache]: Analyzing trace with hash 638034548, now seen corresponding path program 1 times [2019-12-07 14:15:05,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:05,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234369644] [2019-12-07 14:15:05,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:15:05,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234369644] [2019-12-07 14:15:05,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:05,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:05,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848462346] [2019-12-07 14:15:05,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:05,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:05,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:05,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:05,169 INFO L87 Difference]: Start difference. First operand 9520 states and 15592 transitions. Second operand 4 states. [2019-12-07 14:15:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:05,596 INFO L93 Difference]: Finished difference Result 13806 states and 22471 transitions. [2019-12-07 14:15:05,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:05,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-12-07 14:15:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:05,603 INFO L225 Difference]: With dead ends: 13806 [2019-12-07 14:15:05,603 INFO L226 Difference]: Without dead ends: 9968 [2019-12-07 14:15:05,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9968 states. [2019-12-07 14:15:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9968 to 9520. [2019-12-07 14:15:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15578 transitions. [2019-12-07 14:15:05,756 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15578 transitions. Word has length 214 [2019-12-07 14:15:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:05,756 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15578 transitions. [2019-12-07 14:15:05,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15578 transitions. [2019-12-07 14:15:05,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-12-07 14:15:05,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:05,761 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:05,761 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:05,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1261579230, now seen corresponding path program 1 times [2019-12-07 14:15:05,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:05,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134170713] [2019-12-07 14:15:05,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:15:05,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134170713] [2019-12-07 14:15:05,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:05,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:05,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957028265] [2019-12-07 14:15:05,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:05,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:05,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:05,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:05,852 INFO L87 Difference]: Start difference. First operand 9520 states and 15578 transitions. Second operand 4 states. [2019-12-07 14:15:06,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:06,254 INFO L93 Difference]: Finished difference Result 13806 states and 22450 transitions. [2019-12-07 14:15:06,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:06,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2019-12-07 14:15:06,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:06,261 INFO L225 Difference]: With dead ends: 13806 [2019-12-07 14:15:06,261 INFO L226 Difference]: Without dead ends: 9968 [2019-12-07 14:15:06,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9968 states. [2019-12-07 14:15:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9968 to 9520. [2019-12-07 14:15:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15564 transitions. [2019-12-07 14:15:06,416 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15564 transitions. Word has length 215 [2019-12-07 14:15:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:06,416 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15564 transitions. [2019-12-07 14:15:06,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15564 transitions. [2019-12-07 14:15:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-12-07 14:15:06,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:06,421 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:06,421 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:06,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1525949775, now seen corresponding path program 1 times [2019-12-07 14:15:06,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:06,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102595590] [2019-12-07 14:15:06,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:15:06,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102595590] [2019-12-07 14:15:06,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:06,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:06,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43732059] [2019-12-07 14:15:06,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:06,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:06,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:06,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:06,480 INFO L87 Difference]: Start difference. First operand 9520 states and 15564 transitions. Second operand 4 states. [2019-12-07 14:15:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:06,891 INFO L93 Difference]: Finished difference Result 13736 states and 22345 transitions. [2019-12-07 14:15:06,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:06,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2019-12-07 14:15:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:06,898 INFO L225 Difference]: With dead ends: 13736 [2019-12-07 14:15:06,898 INFO L226 Difference]: Without dead ends: 9898 [2019-12-07 14:15:06,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9898 states. [2019-12-07 14:15:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9898 to 9520. [2019-12-07 14:15:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15550 transitions. [2019-12-07 14:15:07,052 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15550 transitions. Word has length 216 [2019-12-07 14:15:07,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:07,052 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15550 transitions. [2019-12-07 14:15:07,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15550 transitions. [2019-12-07 14:15:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-12-07 14:15:07,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:07,057 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:07,057 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:07,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:07,058 INFO L82 PathProgramCache]: Analyzing trace with hash -624343254, now seen corresponding path program 1 times [2019-12-07 14:15:07,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:07,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801177563] [2019-12-07 14:15:07,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:15:07,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801177563] [2019-12-07 14:15:07,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:07,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:07,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891658150] [2019-12-07 14:15:07,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:07,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:07,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:07,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:07,141 INFO L87 Difference]: Start difference. First operand 9520 states and 15550 transitions. Second operand 4 states. [2019-12-07 14:15:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:07,595 INFO L93 Difference]: Finished difference Result 13904 states and 22534 transitions. [2019-12-07 14:15:07,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:07,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-12-07 14:15:07,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:07,603 INFO L225 Difference]: With dead ends: 13904 [2019-12-07 14:15:07,603 INFO L226 Difference]: Without dead ends: 10066 [2019-12-07 14:15:07,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10066 states. [2019-12-07 14:15:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10066 to 9520. [2019-12-07 14:15:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15536 transitions. [2019-12-07 14:15:07,762 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15536 transitions. Word has length 219 [2019-12-07 14:15:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:07,762 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15536 transitions. [2019-12-07 14:15:07,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15536 transitions. [2019-12-07 14:15:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-12-07 14:15:07,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:07,767 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:07,767 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:07,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:07,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1008367889, now seen corresponding path program 1 times [2019-12-07 14:15:07,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:07,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980639016] [2019-12-07 14:15:07,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:15:07,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980639016] [2019-12-07 14:15:07,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:07,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:07,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350220048] [2019-12-07 14:15:07,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:07,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:07,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:07,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:07,851 INFO L87 Difference]: Start difference. First operand 9520 states and 15536 transitions. Second operand 4 states. [2019-12-07 14:15:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:08,317 INFO L93 Difference]: Finished difference Result 13904 states and 22513 transitions. [2019-12-07 14:15:08,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:08,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-12-07 14:15:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:08,323 INFO L225 Difference]: With dead ends: 13904 [2019-12-07 14:15:08,323 INFO L226 Difference]: Without dead ends: 10066 [2019-12-07 14:15:08,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:08,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10066 states. [2019-12-07 14:15:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10066 to 9520. [2019-12-07 14:15:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15522 transitions. [2019-12-07 14:15:08,484 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15522 transitions. Word has length 220 [2019-12-07 14:15:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:08,484 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15522 transitions. [2019-12-07 14:15:08,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15522 transitions. [2019-12-07 14:15:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-12-07 14:15:08,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:08,490 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:08,490 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:08,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:08,490 INFO L82 PathProgramCache]: Analyzing trace with hash -71296855, now seen corresponding path program 1 times [2019-12-07 14:15:08,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:08,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15764847] [2019-12-07 14:15:08,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:15:08,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15764847] [2019-12-07 14:15:08,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:08,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:08,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370226385] [2019-12-07 14:15:08,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:08,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:08,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:08,550 INFO L87 Difference]: Start difference. First operand 9520 states and 15522 transitions. Second operand 4 states. [2019-12-07 14:15:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:09,000 INFO L93 Difference]: Finished difference Result 19399 states and 31536 transitions. [2019-12-07 14:15:09,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:09,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-12-07 14:15:09,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:09,007 INFO L225 Difference]: With dead ends: 19399 [2019-12-07 14:15:09,008 INFO L226 Difference]: Without dead ends: 9898 [2019-12-07 14:15:09,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9898 states. [2019-12-07 14:15:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9898 to 9520. [2019-12-07 14:15:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15508 transitions. [2019-12-07 14:15:09,170 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15508 transitions. Word has length 220 [2019-12-07 14:15:09,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:09,170 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15508 transitions. [2019-12-07 14:15:09,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15508 transitions. [2019-12-07 14:15:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-12-07 14:15:09,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:09,175 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:09,175 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:09,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:09,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1269910827, now seen corresponding path program 1 times [2019-12-07 14:15:09,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:09,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786137785] [2019-12-07 14:15:09,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:15:09,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786137785] [2019-12-07 14:15:09,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:09,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:09,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825049022] [2019-12-07 14:15:09,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:09,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:09,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:09,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:09,237 INFO L87 Difference]: Start difference. First operand 9520 states and 15508 transitions. Second operand 4 states. [2019-12-07 14:15:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:09,660 INFO L93 Difference]: Finished difference Result 19399 states and 31508 transitions. [2019-12-07 14:15:09,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:09,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-12-07 14:15:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:09,668 INFO L225 Difference]: With dead ends: 19399 [2019-12-07 14:15:09,668 INFO L226 Difference]: Without dead ends: 9898 [2019-12-07 14:15:09,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:09,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9898 states. [2019-12-07 14:15:09,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9898 to 9520. [2019-12-07 14:15:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15494 transitions. [2019-12-07 14:15:09,835 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15494 transitions. Word has length 220 [2019-12-07 14:15:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:09,835 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15494 transitions. [2019-12-07 14:15:09,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15494 transitions. [2019-12-07 14:15:09,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-12-07 14:15:09,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:09,839 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:09,839 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:09,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1628819749, now seen corresponding path program 1 times [2019-12-07 14:15:09,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:09,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375476716] [2019-12-07 14:15:09,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:15:09,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375476716] [2019-12-07 14:15:09,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:09,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:09,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919665242] [2019-12-07 14:15:09,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:09,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:09,922 INFO L87 Difference]: Start difference. First operand 9520 states and 15494 transitions. Second operand 4 states. [2019-12-07 14:15:10,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:10,389 INFO L93 Difference]: Finished difference Result 13904 states and 22450 transitions. [2019-12-07 14:15:10,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:10,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-12-07 14:15:10,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:10,396 INFO L225 Difference]: With dead ends: 13904 [2019-12-07 14:15:10,396 INFO L226 Difference]: Without dead ends: 10066 [2019-12-07 14:15:10,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10066 states. [2019-12-07 14:15:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10066 to 9520. [2019-12-07 14:15:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15480 transitions. [2019-12-07 14:15:10,575 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15480 transitions. Word has length 221 [2019-12-07 14:15:10,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:10,575 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15480 transitions. [2019-12-07 14:15:10,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15480 transitions. [2019-12-07 14:15:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-12-07 14:15:10,579 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:10,580 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:10,580 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:10,580 INFO L82 PathProgramCache]: Analyzing trace with hash 488697372, now seen corresponding path program 1 times [2019-12-07 14:15:10,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:10,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389510644] [2019-12-07 14:15:10,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:15:10,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389510644] [2019-12-07 14:15:10,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:10,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:10,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060744190] [2019-12-07 14:15:10,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:10,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:10,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:10,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:10,641 INFO L87 Difference]: Start difference. First operand 9520 states and 15480 transitions. Second operand 4 states. [2019-12-07 14:15:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:11,085 INFO L93 Difference]: Finished difference Result 19343 states and 31374 transitions. [2019-12-07 14:15:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:11,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-12-07 14:15:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:11,091 INFO L225 Difference]: With dead ends: 19343 [2019-12-07 14:15:11,092 INFO L226 Difference]: Without dead ends: 9842 [2019-12-07 14:15:11,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9842 states. [2019-12-07 14:15:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9842 to 9520. [2019-12-07 14:15:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15466 transitions. [2019-12-07 14:15:11,259 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15466 transitions. Word has length 221 [2019-12-07 14:15:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:11,259 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15466 transitions. [2019-12-07 14:15:11,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15466 transitions. [2019-12-07 14:15:11,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-12-07 14:15:11,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:11,264 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:11,264 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:11,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:11,264 INFO L82 PathProgramCache]: Analyzing trace with hash 562383080, now seen corresponding path program 1 times [2019-12-07 14:15:11,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:11,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695948994] [2019-12-07 14:15:11,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:15:11,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695948994] [2019-12-07 14:15:11,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:11,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:11,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942891936] [2019-12-07 14:15:11,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:11,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:11,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:11,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:11,326 INFO L87 Difference]: Start difference. First operand 9520 states and 15466 transitions. Second operand 4 states. [2019-12-07 14:15:11,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:11,735 INFO L93 Difference]: Finished difference Result 19273 states and 31254 transitions. [2019-12-07 14:15:11,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:11,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-12-07 14:15:11,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:11,742 INFO L225 Difference]: With dead ends: 19273 [2019-12-07 14:15:11,742 INFO L226 Difference]: Without dead ends: 9772 [2019-12-07 14:15:11,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9772 states. [2019-12-07 14:15:11,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9772 to 9520. [2019-12-07 14:15:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15452 transitions. [2019-12-07 14:15:11,915 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15452 transitions. Word has length 221 [2019-12-07 14:15:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:11,915 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15452 transitions. [2019-12-07 14:15:11,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15452 transitions. [2019-12-07 14:15:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-12-07 14:15:11,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:11,920 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:11,920 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:11,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:11,920 INFO L82 PathProgramCache]: Analyzing trace with hash 934004908, now seen corresponding path program 1 times [2019-12-07 14:15:11,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:11,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856612530] [2019-12-07 14:15:11,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-12-07 14:15:12,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856612530] [2019-12-07 14:15:12,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:12,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:12,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050721734] [2019-12-07 14:15:12,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:12,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:12,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:12,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:12,013 INFO L87 Difference]: Start difference. First operand 9520 states and 15452 transitions. Second operand 4 states. [2019-12-07 14:15:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:12,563 INFO L93 Difference]: Finished difference Result 13834 states and 22303 transitions. [2019-12-07 14:15:12,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:12,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2019-12-07 14:15:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:12,570 INFO L225 Difference]: With dead ends: 13834 [2019-12-07 14:15:12,570 INFO L226 Difference]: Without dead ends: 9996 [2019-12-07 14:15:12,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2019-12-07 14:15:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 9520. [2019-12-07 14:15:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9520 states. [2019-12-07 14:15:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9520 states to 9520 states and 15438 transitions. [2019-12-07 14:15:12,745 INFO L78 Accepts]: Start accepts. Automaton has 9520 states and 15438 transitions. Word has length 222 [2019-12-07 14:15:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:12,745 INFO L462 AbstractCegarLoop]: Abstraction has 9520 states and 15438 transitions. [2019-12-07 14:15:12,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 9520 states and 15438 transitions. [2019-12-07 14:15:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-12-07 14:15:12,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:12,750 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:12,750 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:12,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1472895795, now seen corresponding path program 1 times [2019-12-07 14:15:12,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:12,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550872736] [2019-12-07 14:15:12,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-12-07 14:15:12,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550872736] [2019-12-07 14:15:12,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:12,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:15:12,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158997384] [2019-12-07 14:15:12,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:15:12,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:12,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:15:12,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:12,835 INFO L87 Difference]: Start difference. First operand 9520 states and 15438 transitions. Second operand 5 states. [2019-12-07 14:15:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:13,396 INFO L93 Difference]: Finished difference Result 19968 states and 32137 transitions. [2019-12-07 14:15:13,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:13,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 224 [2019-12-07 14:15:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:13,403 INFO L225 Difference]: With dead ends: 19968 [2019-12-07 14:15:13,403 INFO L226 Difference]: Without dead ends: 10425 [2019-12-07 14:15:13,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:15:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10425 states. [2019-12-07 14:15:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10425 to 6720. [2019-12-07 14:15:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6720 states. [2019-12-07 14:15:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6720 states to 6720 states and 10714 transitions. [2019-12-07 14:15:13,563 INFO L78 Accepts]: Start accepts. Automaton has 6720 states and 10714 transitions. Word has length 224 [2019-12-07 14:15:13,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:13,563 INFO L462 AbstractCegarLoop]: Abstraction has 6720 states and 10714 transitions. [2019-12-07 14:15:13,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:15:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand 6720 states and 10714 transitions. [2019-12-07 14:15:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-12-07 14:15:13,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:13,566 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:13,566 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:13,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:13,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1167711913, now seen corresponding path program 1 times [2019-12-07 14:15:13,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:13,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233348371] [2019-12-07 14:15:13,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 144 proven. 6 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2019-12-07 14:15:13,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233348371] [2019-12-07 14:15:13,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757224785] [2019-12-07 14:15:13,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:13,825 INFO L264 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:15:13,831 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:15:13,837 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 20 treesize of output 8 [2019-12-07 14:15:13,838 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:13,839 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:13,839 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:13,839 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 14:15:13,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:15:13,842 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:13,843 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:13,843 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:13,843 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:15:13,850 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|, |v_#memory_$Pointer$.base_172|], 2=[|v_#memory_int_182|]} [2019-12-07 14:15:13,851 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 31 treesize of output 25 [2019-12-07 14:15:13,852 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:13,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:13,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 14:15:13,857 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:13,861 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:13,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:13,872 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 56 [2019-12-07 14:15:13,872 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:13,888 INFO L614 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-12-07 14:15:13,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:13,888 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:13,888 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-12-07 14:15:13,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:13,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:13,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:13,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:15:13,906 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:13,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:13,927 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:13,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-12-07 14:15:13,927 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:13,960 INFO L614 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-12-07 14:15:13,961 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:15:13,961 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-12-07 14:15:13,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:13,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:13,982 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 28 treesize of output 10 [2019-12-07 14:15:13,983 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:13,985 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:15:13,985 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 28 treesize of output 10 [2019-12-07 14:15:13,985 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:13,987 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:13,988 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:15:13,988 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-12-07 14:15:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 144 proven. 6 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2019-12-07 14:15:14,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:15:14,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2019-12-07 14:15:14,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429512990] [2019-12-07 14:15:14,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:15:14,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:14,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:15:14,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:15:14,063 INFO L87 Difference]: Start difference. First operand 6720 states and 10714 transitions. Second operand 11 states. [2019-12-07 14:15:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:16,398 INFO L93 Difference]: Finished difference Result 16920 states and 26600 transitions. [2019-12-07 14:15:16,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:15:16,398 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2019-12-07 14:15:16,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:16,405 INFO L225 Difference]: With dead ends: 16920 [2019-12-07 14:15:16,405 INFO L226 Difference]: Without dead ends: 10219 [2019-12-07 14:15:16,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:15:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10219 states. [2019-12-07 14:15:16,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10219 to 6720. [2019-12-07 14:15:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6720 states. [2019-12-07 14:15:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6720 states to 6720 states and 10623 transitions. [2019-12-07 14:15:16,582 INFO L78 Accepts]: Start accepts. Automaton has 6720 states and 10623 transitions. Word has length 232 [2019-12-07 14:15:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:16,582 INFO L462 AbstractCegarLoop]: Abstraction has 6720 states and 10623 transitions. [2019-12-07 14:15:16,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:15:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 6720 states and 10623 transitions. [2019-12-07 14:15:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-12-07 14:15:16,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:16,585 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:16,786 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:16,787 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:16,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:16,787 INFO L82 PathProgramCache]: Analyzing trace with hash -66998368, now seen corresponding path program 1 times [2019-12-07 14:15:16,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:16,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359929614] [2019-12-07 14:15:16,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 145 proven. 5 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2019-12-07 14:15:16,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359929614] [2019-12-07 14:15:16,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381779633] [2019-12-07 14:15:16,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:17,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:15:17,083 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:15:17,088 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 20 treesize of output 8 [2019-12-07 14:15:17,089 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:17,090 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:17,090 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:17,090 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 14:15:17,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:15:17,093 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:17,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:17,094 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:17,094 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:15:17,102 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_161|, |v_#memory_$Pointer$.base_173|], 2=[|v_#memory_int_185|]} [2019-12-07 14:15:17,104 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 31 treesize of output 25 [2019-12-07 14:15:17,104 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:17,108 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:17,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 14:15:17,110 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:17,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:17,125 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:17,125 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 56 [2019-12-07 14:15:17,126 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:17,141 INFO L614 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-12-07 14:15:17,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:17,142 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:17,142 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-12-07 14:15:17,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:17,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:17,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:17,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:15:17,159 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:17,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:17,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:17,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-12-07 14:15:17,178 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:17,208 INFO L614 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-12-07 14:15:17,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:15:17,209 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-12-07 14:15:17,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:17,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:17,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 14:15:17,230 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:17,232 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:15:17,233 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 28 treesize of output 10 [2019-12-07 14:15:17,233 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:17,235 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:17,235 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:15:17,236 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-12-07 14:15:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 145 proven. 5 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2019-12-07 14:15:17,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:15:17,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2019-12-07 14:15:17,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911633962] [2019-12-07 14:15:17,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:15:17,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:17,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:15:17,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:15:17,289 INFO L87 Difference]: Start difference. First operand 6720 states and 10623 transitions. Second operand 11 states. [2019-12-07 14:15:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:19,283 INFO L93 Difference]: Finished difference Result 16584 states and 25844 transitions. [2019-12-07 14:15:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:15:19,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2019-12-07 14:15:19,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:19,290 INFO L225 Difference]: With dead ends: 16584 [2019-12-07 14:15:19,291 INFO L226 Difference]: Without dead ends: 9883 [2019-12-07 14:15:19,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:15:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9883 states. [2019-12-07 14:15:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9883 to 6720. [2019-12-07 14:15:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6720 states. [2019-12-07 14:15:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6720 states to 6720 states and 10532 transitions. [2019-12-07 14:15:19,479 INFO L78 Accepts]: Start accepts. Automaton has 6720 states and 10532 transitions. Word has length 233 [2019-12-07 14:15:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:19,480 INFO L462 AbstractCegarLoop]: Abstraction has 6720 states and 10532 transitions. [2019-12-07 14:15:19,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:15:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 6720 states and 10532 transitions. [2019-12-07 14:15:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-12-07 14:15:19,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:19,483 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:19,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:19,684 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:19,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:19,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1284472874, now seen corresponding path program 1 times [2019-12-07 14:15:19,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:19,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298679747] [2019-12-07 14:15:19,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 286 proven. 17 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-12-07 14:15:20,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298679747] [2019-12-07 14:15:20,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769997519] [2019-12-07 14:15:20,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:20,169 INFO L264 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 14:15:20,172 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:15:20,218 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_162|, |v_#memory_$Pointer$.base_174|], 6=[|v_#memory_int_187|]} [2019-12-07 14:15:20,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:20,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2019-12-07 14:15:20,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:20,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:20,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2019-12-07 14:15:20,235 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,241 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:20,262 INFO L343 Elim1Store]: treesize reduction 70, result has 41.7 percent of original size [2019-12-07 14:15:20,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 62 [2019-12-07 14:15:20,262 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:20,271 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,271 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:77 [2019-12-07 14:15:20,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:20,364 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_175|, |v_#memory_$Pointer$.offset_163|], 6=[|v_#memory_int_188|]} [2019-12-07 14:15:20,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:20,372 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2019-12-07 14:15:20,372 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:20,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 35 [2019-12-07 14:15:20,378 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,415 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:20,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:20,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2019-12-07 14:15:20,422 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:20,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 37 [2019-12-07 14:15:20,428 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:20,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2019-12-07 14:15:20,460 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:20,466 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:20,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 37 [2019-12-07 14:15:20,467 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,483 INFO L614 ElimStorePlain]: treesize reduction 57, result has 37.4 percent of original size [2019-12-07 14:15:20,484 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,484 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:205, output treesize:34 [2019-12-07 14:15:20,507 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_176|, |v_#memory_$Pointer$.offset_164|], 6=[|v_#memory_int_189|]} [2019-12-07 14:15:20,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2019-12-07 14:15:20,509 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:20,515 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:20,517 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 35 treesize of output 23 [2019-12-07 14:15:20,518 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:20,525 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:20,541 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:20,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 75 [2019-12-07 14:15:20,542 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,561 INFO L614 ElimStorePlain]: treesize reduction 47, result has 31.9 percent of original size [2019-12-07 14:15:20,561 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:20,561 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:22 [2019-12-07 14:15:20,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:20,601 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:20,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-12-07 14:15:20,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,624 INFO L614 ElimStorePlain]: treesize reduction 44, result has 49.4 percent of original size [2019-12-07 14:15:20,624 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:20,624 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2019-12-07 14:15:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 265 proven. 28 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-12-07 14:15:20,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:15:20,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-12-07 14:15:20,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805647729] [2019-12-07 14:15:20,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 14:15:20,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:20,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 14:15:20,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:15:20,805 INFO L87 Difference]: Start difference. First operand 6720 states and 10532 transitions. Second operand 22 states. [2019-12-07 14:15:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:25,219 INFO L93 Difference]: Finished difference Result 20522 states and 31527 transitions. [2019-12-07 14:15:25,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 14:15:25,221 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 237 [2019-12-07 14:15:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:25,230 INFO L225 Difference]: With dead ends: 20522 [2019-12-07 14:15:25,230 INFO L226 Difference]: Without dead ends: 13821 [2019-12-07 14:15:25,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 14:15:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2019-12-07 14:15:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 7679. [2019-12-07 14:15:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7679 states. [2019-12-07 14:15:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7679 states to 7679 states and 12114 transitions. [2019-12-07 14:15:25,468 INFO L78 Accepts]: Start accepts. Automaton has 7679 states and 12114 transitions. Word has length 237 [2019-12-07 14:15:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:25,468 INFO L462 AbstractCegarLoop]: Abstraction has 7679 states and 12114 transitions. [2019-12-07 14:15:25,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 14:15:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 7679 states and 12114 transitions. [2019-12-07 14:15:25,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-12-07 14:15:25,472 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:25,472 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:25,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:25,673 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:25,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:25,674 INFO L82 PathProgramCache]: Analyzing trace with hash -756794112, now seen corresponding path program 1 times [2019-12-07 14:15:25,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:25,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305962214] [2019-12-07 14:15:25,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 379 proven. 54 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 14:15:25,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305962214] [2019-12-07 14:15:25,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973783947] [2019-12-07 14:15:25,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:25,990 INFO L264 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:15:25,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:15:25,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:15:25,998 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:25,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:25,999 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:25,999 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:15:26,006 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|, |v_#memory_$Pointer$.offset_165|], 2=[|v_#memory_int_192|]} [2019-12-07 14:15:26,008 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 31 treesize of output 19 [2019-12-07 14:15:26,008 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:26,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:26,033 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-12-07 14:15:26,033 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:26,037 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:26,049 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:26,049 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 56 [2019-12-07 14:15:26,050 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:26,065 INFO L614 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-12-07 14:15:26,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:26,066 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:26,066 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-12-07 14:15:26,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:26,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:26,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:26,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:26,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-12-07 14:15:26,105 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:26,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:26,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:15:26,110 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:26,142 INFO L614 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-12-07 14:15:26,142 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:15:26,142 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-12-07 14:15:26,209 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:15:26,210 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 28 treesize of output 10 [2019-12-07 14:15:26,210 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:26,211 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:26,211 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:26,211 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:15:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2019-12-07 14:15:26,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:15:26,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2019-12-07 14:15:26,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168762470] [2019-12-07 14:15:26,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:15:26,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:26,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:15:26,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:15:26,275 INFO L87 Difference]: Start difference. First operand 7679 states and 12114 transitions. Second operand 8 states. [2019-12-07 14:15:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:28,279 INFO L93 Difference]: Finished difference Result 19585 states and 30782 transitions. [2019-12-07 14:15:28,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:15:28,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2019-12-07 14:15:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:28,287 INFO L225 Difference]: With dead ends: 19585 [2019-12-07 14:15:28,287 INFO L226 Difference]: Without dead ends: 11925 [2019-12-07 14:15:28,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:15:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11925 states. [2019-12-07 14:15:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11925 to 7910. [2019-12-07 14:15:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7910 states. [2019-12-07 14:15:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7910 states to 7910 states and 12513 transitions. [2019-12-07 14:15:28,526 INFO L78 Accepts]: Start accepts. Automaton has 7910 states and 12513 transitions. Word has length 249 [2019-12-07 14:15:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:28,526 INFO L462 AbstractCegarLoop]: Abstraction has 7910 states and 12513 transitions. [2019-12-07 14:15:28,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:15:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 7910 states and 12513 transitions. [2019-12-07 14:15:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-12-07 14:15:28,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:28,530 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:28,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:28,731 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:28,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1992818174, now seen corresponding path program 1 times [2019-12-07 14:15:28,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:28,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346168579] [2019-12-07 14:15:28,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 382 proven. 54 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-12-07 14:15:28,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346168579] [2019-12-07 14:15:28,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282282940] [2019-12-07 14:15:28,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:29,041 INFO L264 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:15:29,044 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:15:29,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:15:29,049 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:29,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:29,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:29,050 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:15:29,057 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_178|, |v_#memory_$Pointer$.offset_166|], 2=[|v_#memory_int_195|]} [2019-12-07 14:15:29,059 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 31 treesize of output 19 [2019-12-07 14:15:29,059 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:29,063 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:29,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-12-07 14:15:29,065 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:29,068 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:29,079 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:29,080 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 56 [2019-12-07 14:15:29,080 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:29,096 INFO L614 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-12-07 14:15:29,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:29,096 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:29,096 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-12-07 14:15:29,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:29,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:29,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:29,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:15:29,115 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:29,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:29,133 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:29,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-12-07 14:15:29,134 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:29,164 INFO L614 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-12-07 14:15:29,165 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:15:29,165 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-12-07 14:15:29,232 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:15:29,232 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 28 treesize of output 10 [2019-12-07 14:15:29,232 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:29,233 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:29,233 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:29,233 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:15:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2019-12-07 14:15:29,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:15:29,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2019-12-07 14:15:29,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445220181] [2019-12-07 14:15:29,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:15:29,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:29,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:15:29,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:15:29,305 INFO L87 Difference]: Start difference. First operand 7910 states and 12513 transitions. Second operand 8 states. [2019-12-07 14:15:31,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:31,587 INFO L93 Difference]: Finished difference Result 19646 states and 30898 transitions. [2019-12-07 14:15:31,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:15:31,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2019-12-07 14:15:31,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:31,595 INFO L225 Difference]: With dead ends: 19646 [2019-12-07 14:15:31,595 INFO L226 Difference]: Without dead ends: 11755 [2019-12-07 14:15:31,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:15:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11755 states. [2019-12-07 14:15:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11755 to 8526. [2019-12-07 14:15:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8526 states. [2019-12-07 14:15:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8526 states to 8526 states and 13549 transitions. [2019-12-07 14:15:31,858 INFO L78 Accepts]: Start accepts. Automaton has 8526 states and 13549 transitions. Word has length 250 [2019-12-07 14:15:31,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:31,858 INFO L462 AbstractCegarLoop]: Abstraction has 8526 states and 13549 transitions. [2019-12-07 14:15:31,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:15:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 8526 states and 13549 transitions. [2019-12-07 14:15:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-12-07 14:15:31,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:31,863 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:32,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:32,064 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:32,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:32,064 INFO L82 PathProgramCache]: Analyzing trace with hash 769294694, now seen corresponding path program 1 times [2019-12-07 14:15:32,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:32,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596890028] [2019-12-07 14:15:32,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2019-12-07 14:15:32,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596890028] [2019-12-07 14:15:32,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:32,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:15:32,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524521588] [2019-12-07 14:15:32,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:15:32,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:32,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:15:32,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:15:32,166 INFO L87 Difference]: Start difference. First operand 8526 states and 13549 transitions. Second operand 4 states. [2019-12-07 14:15:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:32,785 INFO L93 Difference]: Finished difference Result 18321 states and 29046 transitions. [2019-12-07 14:15:32,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:32,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-12-07 14:15:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:32,791 INFO L225 Difference]: With dead ends: 18321 [2019-12-07 14:15:32,791 INFO L226 Difference]: Without dead ends: 9814 [2019-12-07 14:15:32,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:32,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9814 states. [2019-12-07 14:15:33,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9814 to 8246. [2019-12-07 14:15:33,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8246 states. [2019-12-07 14:15:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8246 states to 8246 states and 13101 transitions. [2019-12-07 14:15:33,064 INFO L78 Accepts]: Start accepts. Automaton has 8246 states and 13101 transitions. Word has length 252 [2019-12-07 14:15:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:33,064 INFO L462 AbstractCegarLoop]: Abstraction has 8246 states and 13101 transitions. [2019-12-07 14:15:33,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:15:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 8246 states and 13101 transitions. [2019-12-07 14:15:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-12-07 14:15:33,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:33,069 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:33,069 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:33,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:33,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1024130447, now seen corresponding path program 1 times [2019-12-07 14:15:33,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:33,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918966292] [2019-12-07 14:15:33,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-12-07 14:15:33,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918966292] [2019-12-07 14:15:33,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:15:33,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:15:33,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567063102] [2019-12-07 14:15:33,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:15:33,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:33,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:15:33,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:15:33,172 INFO L87 Difference]: Start difference. First operand 8246 states and 13101 transitions. Second operand 5 states. [2019-12-07 14:15:33,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:33,835 INFO L93 Difference]: Finished difference Result 17329 states and 27323 transitions. [2019-12-07 14:15:33,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:15:33,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 253 [2019-12-07 14:15:33,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:33,841 INFO L225 Difference]: With dead ends: 17329 [2019-12-07 14:15:33,841 INFO L226 Difference]: Without dead ends: 9102 [2019-12-07 14:15:33,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:15:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9102 states. [2019-12-07 14:15:34,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9102 to 7686. [2019-12-07 14:15:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7686 states. [2019-12-07 14:15:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7686 states to 7686 states and 12107 transitions. [2019-12-07 14:15:34,075 INFO L78 Accepts]: Start accepts. Automaton has 7686 states and 12107 transitions. Word has length 253 [2019-12-07 14:15:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:34,076 INFO L462 AbstractCegarLoop]: Abstraction has 7686 states and 12107 transitions. [2019-12-07 14:15:34,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:15:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 7686 states and 12107 transitions. [2019-12-07 14:15:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-12-07 14:15:34,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:34,080 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:34,080 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:34,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1335699359, now seen corresponding path program 1 times [2019-12-07 14:15:34,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:34,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133395604] [2019-12-07 14:15:34,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 304 proven. 8 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-12-07 14:15:34,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133395604] [2019-12-07 14:15:34,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406194519] [2019-12-07 14:15:34,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:34,369 INFO L264 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:15:34,372 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:15:34,377 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 20 treesize of output 8 [2019-12-07 14:15:34,378 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:34,379 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:34,379 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:34,379 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 14:15:34,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:15:34,382 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:34,383 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:34,383 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:34,383 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:15:34,390 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_167|, |v_#memory_$Pointer$.base_179|], 2=[|v_#memory_int_198|]} [2019-12-07 14:15:34,392 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 31 treesize of output 25 [2019-12-07 14:15:34,392 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:34,396 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:34,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 14:15:34,398 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:34,402 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:34,413 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:34,414 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 56 [2019-12-07 14:15:34,414 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:34,429 INFO L614 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-12-07 14:15:34,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:34,430 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:34,430 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-12-07 14:15:34,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:34,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:34,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:34,462 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:34,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-12-07 14:15:34,462 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:34,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:34,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:15:34,467 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:34,496 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-07 14:15:34,497 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:15:34,497 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-12-07 14:15:34,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:34,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:34,519 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 28 treesize of output 10 [2019-12-07 14:15:34,520 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:34,522 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:15:34,522 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 28 treesize of output 10 [2019-12-07 14:15:34,522 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:34,527 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:34,527 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:15:34,527 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-12-07 14:15:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 304 proven. 8 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-12-07 14:15:34,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:15:34,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2019-12-07 14:15:34,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778265850] [2019-12-07 14:15:34,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:15:34,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:34,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:15:34,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:15:34,588 INFO L87 Difference]: Start difference. First operand 7686 states and 12107 transitions. Second operand 11 states. [2019-12-07 14:15:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:36,872 INFO L93 Difference]: Finished difference Result 18199 states and 28367 transitions. [2019-12-07 14:15:36,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:15:36,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 260 [2019-12-07 14:15:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:36,880 INFO L225 Difference]: With dead ends: 18199 [2019-12-07 14:15:36,881 INFO L226 Difference]: Without dead ends: 10532 [2019-12-07 14:15:36,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:15:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10532 states. [2019-12-07 14:15:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10532 to 8050. [2019-12-07 14:15:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8050 states. [2019-12-07 14:15:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8050 states to 8050 states and 12632 transitions. [2019-12-07 14:15:37,144 INFO L78 Accepts]: Start accepts. Automaton has 8050 states and 12632 transitions. Word has length 260 [2019-12-07 14:15:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:37,144 INFO L462 AbstractCegarLoop]: Abstraction has 8050 states and 12632 transitions. [2019-12-07 14:15:37,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:15:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 8050 states and 12632 transitions. [2019-12-07 14:15:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-12-07 14:15:37,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:37,149 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:37,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:37,350 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:37,350 INFO L82 PathProgramCache]: Analyzing trace with hash -752619464, now seen corresponding path program 1 times [2019-12-07 14:15:37,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:37,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548673776] [2019-12-07 14:15:37,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 306 proven. 7 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2019-12-07 14:15:37,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548673776] [2019-12-07 14:15:37,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362403496] [2019-12-07 14:15:37,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:37,673 INFO L264 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:15:37,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:15:37,680 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 20 treesize of output 8 [2019-12-07 14:15:37,680 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:37,681 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:37,682 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:37,682 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 14:15:37,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:15:37,684 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:37,685 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:37,685 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:37,685 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:15:37,691 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_168|, |v_#memory_$Pointer$.base_180|], 2=[|v_#memory_int_201|]} [2019-12-07 14:15:37,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-12-07 14:15:37,693 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:37,696 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:37,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 14:15:37,698 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:37,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:37,713 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:37,713 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 56 [2019-12-07 14:15:37,713 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:37,729 INFO L614 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-12-07 14:15:37,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:37,729 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:37,729 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-12-07 14:15:37,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:37,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:37,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:37,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:15:37,747 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:37,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:37,765 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:37,765 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-12-07 14:15:37,766 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:37,796 INFO L614 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-12-07 14:15:37,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:15:37,796 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-12-07 14:15:37,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:37,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:37,817 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 28 treesize of output 10 [2019-12-07 14:15:37,818 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:37,820 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:15:37,820 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 28 treesize of output 10 [2019-12-07 14:15:37,820 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:37,822 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:37,822 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:15:37,822 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-12-07 14:15:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 306 proven. 7 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2019-12-07 14:15:37,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:15:37,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2019-12-07 14:15:37,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577909536] [2019-12-07 14:15:37,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:15:37,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:15:37,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:15:37,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:15:37,883 INFO L87 Difference]: Start difference. First operand 8050 states and 12632 transitions. Second operand 11 states. [2019-12-07 14:15:40,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:15:40,031 INFO L93 Difference]: Finished difference Result 18479 states and 28619 transitions. [2019-12-07 14:15:40,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:15:40,032 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 261 [2019-12-07 14:15:40,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:15:40,038 INFO L225 Difference]: With dead ends: 18479 [2019-12-07 14:15:40,038 INFO L226 Difference]: Without dead ends: 10448 [2019-12-07 14:15:40,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 261 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:15:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10448 states. [2019-12-07 14:15:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10448 to 8050. [2019-12-07 14:15:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8050 states. [2019-12-07 14:15:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8050 states to 8050 states and 12513 transitions. [2019-12-07 14:15:40,303 INFO L78 Accepts]: Start accepts. Automaton has 8050 states and 12513 transitions. Word has length 261 [2019-12-07 14:15:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:15:40,304 INFO L462 AbstractCegarLoop]: Abstraction has 8050 states and 12513 transitions. [2019-12-07 14:15:40,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:15:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 8050 states and 12513 transitions. [2019-12-07 14:15:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-12-07 14:15:40,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:15:40,308 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:15:40,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:40,509 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:15:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:15:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1475487551, now seen corresponding path program 2 times [2019-12-07 14:15:40,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:15:40,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147479918] [2019-12-07 14:15:40,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:15:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:15:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 375 proven. 182 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 14:15:40,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147479918] [2019-12-07 14:15:40,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997850531] [2019-12-07 14:15:40,993 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:15:41,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:15:41,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:15:41,252 INFO L264 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 14:15:41,260 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:15:41,278 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,278 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 27 treesize of output 31 [2019-12-07 14:15:41,279 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,301 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,302 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_187|], 2=[|v_#memory_$Pointer$.base_181|, |v_#memory_$Pointer$.base_182|]} [2019-12-07 14:15:41,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2019-12-07 14:15:41,324 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,349 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:41,369 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2019-12-07 14:15:41,376 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,389 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,390 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,390 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:92, output treesize:44 [2019-12-07 14:15:41,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,409 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 38 [2019-12-07 14:15:41,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,416 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,417 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,417 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:44 [2019-12-07 14:15:41,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 38 [2019-12-07 14:15:41,424 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,430 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,431 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,431 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:44 [2019-12-07 14:15:41,432 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_183|], 6=[|v_#memory_$Pointer$.base_190|]} [2019-12-07 14:15:41,433 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:41,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 47 [2019-12-07 14:15:41,450 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,459 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,460 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:44 [2019-12-07 14:15:41,479 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_int_203|], 6=[|v_#memory_$Pointer$.base_191|]} [2019-12-07 14:15:41,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:15:41,483 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,498 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 38 [2019-12-07 14:15:41,503 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,513 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,513 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:62 [2019-12-07 14:15:41,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 38 [2019-12-07 14:15:41,535 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,547 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-12-07 14:15:41,552 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,562 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,562 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:71 [2019-12-07 14:15:41,585 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_184|], 6=[|v_#memory_$Pointer$.base_193|], 18=[|v_#memory_int_205|]} [2019-12-07 14:15:41,587 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:41,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2019-12-07 14:15:41,620 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,636 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2019-12-07 14:15:41,640 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,653 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,653 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:127, output treesize:71 [2019-12-07 14:15:41,682 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_170|], 12=[|v_#memory_int_206|], 14=[|v_#memory_$Pointer$.base_194|]} [2019-12-07 14:15:41,684 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 81 treesize of output 63 [2019-12-07 14:15:41,685 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:41,704 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2019-12-07 14:15:41,709 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,726 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:15:41,762 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 175 [2019-12-07 14:15:41,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:41,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:41,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:41,764 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,800 INFO L614 ElimStorePlain]: treesize reduction 145, result has 38.3 percent of original size [2019-12-07 14:15:41,800 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:41,800 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:151, output treesize:90 [2019-12-07 14:15:41,831 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_185|], 10=[|v_#memory_$Pointer$.base_195|], 28=[|v_#memory_int_207|]} [2019-12-07 14:15:41,833 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:41,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 58 [2019-12-07 14:15:41,867 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,887 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2019-12-07 14:15:41,892 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:41,905 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,906 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:41,906 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:146, output treesize:90 [2019-12-07 14:15:41,948 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_171|], 10=[|v_#memory_$Pointer$.base_196|], 20=[|v_#memory_int_208|]} [2019-12-07 14:15:41,950 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 81 treesize of output 63 [2019-12-07 14:15:41,951 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:41,971 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:41,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:41,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:42,006 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:42,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 188 [2019-12-07 14:15:42,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:42,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:42,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:42,008 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:42,049 INFO L614 ElimStorePlain]: treesize reduction 129, result has 47.1 percent of original size [2019-12-07 14:15:42,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:42,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:42,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:42,061 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:42,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 102 [2019-12-07 14:15:42,061 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:42,094 INFO L614 ElimStorePlain]: treesize reduction 32, result has 76.6 percent of original size [2019-12-07 14:15:42,095 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:42,095 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:170, output treesize:105 [2019-12-07 14:15:48,144 WARN L192 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 14:15:48,146 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_169|], 2=[|v_#memory_$Pointer$.base_186|], 10=[|v_#memory_$Pointer$.base_197|], 50=[|v_#memory_int_209|]} [2019-12-07 14:15:48,150 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 109 treesize of output 97 [2019-12-07 14:15:48,150 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:48,197 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:48,199 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:48,234 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:48,237 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 192 treesize of output 168 [2019-12-07 14:15:48,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:48,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:48,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:48,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:48,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:48,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:48,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 108 [2019-12-07 14:15:48,248 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:48,258 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:48,259 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:48,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:48,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:48,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:48,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:15:48,307 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:15:48,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 134 [2019-12-07 14:15:48,308 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 14:15:48,344 INFO L614 ElimStorePlain]: treesize reduction 36, result has 68.4 percent of original size [2019-12-07 14:15:48,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:48,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:48,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:48,345 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:15:48,345 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:233, output treesize:78 [2019-12-07 14:15:48,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:48,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:48,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:48,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:48,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:15:48,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:16:38,555 WARN L192 SmtUtils]: Spent 48.15 s on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-12-07 14:17:33,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:17:33,493 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_198|, |v_#memory_$Pointer$.offset_172|], 110=[|v_#memory_int_210|]} [2019-12-07 14:17:33,497 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 31 treesize of output 25 [2019-12-07 14:17:33,498 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:17:33,502 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 31 treesize of output 25 [2019-12-07 14:17:33,503 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:17:33,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-12-07 14:17:33,508 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:17:33,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:17:33,598 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 25 treesize of output 19 [2019-12-07 14:17:33,598 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:17:33,602 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 25 treesize of output 19 [2019-12-07 14:17:33,603 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:17:33,607 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 25 treesize of output 19 [2019-12-07 14:17:33,607 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:17:33,700 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:17:33,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:17:33,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:17:33,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:17:33,774 INFO L343 Elim1Store]: treesize reduction 34, result has 75.0 percent of original size [2019-12-07 14:17:33,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 162 [2019-12-07 14:17:33,775 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 14:17:33,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:17:33,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:17:33,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:17:33,831 INFO L343 Elim1Store]: treesize reduction 34, result has 68.5 percent of original size [2019-12-07 14:17:33,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 122 [2019-12-07 14:17:33,832 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 14:17:33,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:17:33,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:17:33,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:17:33,931 INFO L343 Elim1Store]: treesize reduction 34, result has 80.7 percent of original size [2019-12-07 14:17:33,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 214 [2019-12-07 14:17:33,932 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-07 14:17:34,082 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 97 [2019-12-07 14:17:34,082 INFO L614 ElimStorePlain]: treesize reduction 348, result has 41.2 percent of original size [2019-12-07 14:17:34,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:17:34,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:17:34,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:17:34,084 INFO L534 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2019-12-07 14:17:34,084 INFO L239 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:253, output treesize:244 [2019-12-07 14:17:34,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:17:34,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:17:34,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:02,206 WARN L192 SmtUtils]: Spent 28.07 s on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 14:18:02,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:02,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:02,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:04,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:05,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:06,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:07,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:08,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:08,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:08,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:08,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:08,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:08,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:08,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:08,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:08,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:08,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:18:08,146 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:08,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 51 [2019-12-07 14:18:08,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:18:08,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:18:08,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:18:08,150 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_215, v_arrayElimCell_216], 1=[v_arrayElimCell_217]} [2019-12-07 14:18:08,155 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@73fbcd5f [2019-12-07 14:18:08,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:18:08,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-12-07 14:18:08,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491161527] [2019-12-07 14:18:08,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:18:08,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:08,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:18:08,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=231, Unknown=2, NotChecked=0, Total=306 [2019-12-07 14:18:08,156 INFO L87 Difference]: Start difference. First operand 8050 states and 12513 transitions. Second operand 7 states. [2019-12-07 14:18:08,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 14:18:08,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:18:08,357 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@73fbcd5f at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) 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-12-07 14:18:08,360 INFO L168 Benchmark]: Toolchain (without parser) took 223479.27 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 908.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:08,360 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:18:08,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 472.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -123.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:08,361 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:18:08,361 INFO L168 Benchmark]: Boogie Preprocessor took 70.63 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:08,361 INFO L168 Benchmark]: RCFGBuilder took 709.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 949.6 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:08,362 INFO L168 Benchmark]: TraceAbstraction took 222154.77 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 971.5 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -142.8 MB). Peak memory consumption was 828.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:18:08,363 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 472.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -123.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.63 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 709.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 949.6 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 222154.77 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 971.5 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -142.8 MB). Peak memory consumption was 828.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@73fbcd5f de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@73fbcd5f: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 14:18:09,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:18:09,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:18:09,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:18:09,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:18:09,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:18:09,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:18:09,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:18:09,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:18:09,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:18:09,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:18:09,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:18:09,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:18:09,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:18:09,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:18:09,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:18:09,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:18:09,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:18:09,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:18:09,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:18:09,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:18:09,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:18:09,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:18:09,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:18:09,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:18:09,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:18:09,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:18:09,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:18:09,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:18:09,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:18:09,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:18:09,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:18:09,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:18:09,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:18:09,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:18:09,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:18:09,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:18:09,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:18:09,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:18:09,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:18:09,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:18:09,775 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 14:18:09,785 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:18:09,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:18:09,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:18:09,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:18:09,786 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:18:09,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:18:09,786 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:18:09,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:18:09,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:18:09,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:18:09,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:18:09,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:18:09,787 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 14:18:09,787 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 14:18:09,787 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:18:09,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:18:09,788 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:18:09,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:18:09,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:18:09,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:18:09,788 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:18:09,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:18:09,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:18:09,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:18:09,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:18:09,789 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:18:09,789 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 14:18:09,789 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 14:18:09,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:18:09,789 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:18:09,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:18:09,790 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) 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 -> 4bea9123dc38197075cd07fcd6899770fae2083a [2019-12-07 14:18:09,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:18:09,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:18:09,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:18:09,969 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:18:09,970 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:18:09,970 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c [2019-12-07 14:18:10,011 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/data/e792e2b80/08c49569fbdb4670aeb50ef54b20afa8/FLAG3bf917459 [2019-12-07 14:18:10,552 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:18:10,552 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c [2019-12-07 14:18:10,565 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/data/e792e2b80/08c49569fbdb4670aeb50ef54b20afa8/FLAG3bf917459 [2019-12-07 14:18:10,990 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/data/e792e2b80/08c49569fbdb4670aeb50ef54b20afa8 [2019-12-07 14:18:10,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:18:10,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:18:10,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:18:10,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:18:10,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:18:10,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:18:10" (1/1) ... [2019-12-07 14:18:10,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a94c128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:10, skipping insertion in model container [2019-12-07 14:18:10,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:18:10" (1/1) ... [2019-12-07 14:18:11,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:18:11,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:18:11,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:18:11,319 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:18:11,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:18:11,393 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:18:11,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:11 WrapperNode [2019-12-07 14:18:11,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:18:11,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:18:11,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:18:11,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:18:11,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:11" (1/1) ... [2019-12-07 14:18:11,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:11" (1/1) ... [2019-12-07 14:18:11,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:18:11,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:18:11,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:18:11,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:18:11,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:11" (1/1) ... [2019-12-07 14:18:11,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:11" (1/1) ... [2019-12-07 14:18:11,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:11" (1/1) ... [2019-12-07 14:18:11,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:11" (1/1) ... [2019-12-07 14:18:11,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:11" (1/1) ... [2019-12-07 14:18:11,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:11" (1/1) ... [2019-12-07 14:18:11,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:11" (1/1) ... [2019-12-07 14:18:11,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:18:11,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:18:11,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:18:11,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:18:11,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:18:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:18:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:18:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 14:18:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:18:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:18:11,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:18:11,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:18:11,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 14:18:11,673 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:18:14,416 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 14:18:14,417 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 14:18:14,418 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:18:14,418 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:18:14,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:18:14 BoogieIcfgContainer [2019-12-07 14:18:14,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:18:14,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:18:14,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:18:14,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:18:14,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:18:10" (1/3) ... [2019-12-07 14:18:14,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ebc74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:18:14, skipping insertion in model container [2019-12-07 14:18:14,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:18:11" (2/3) ... [2019-12-07 14:18:14,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ebc74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:18:14, skipping insertion in model container [2019-12-07 14:18:14,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:18:14" (3/3) ... [2019-12-07 14:18:14,424 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.c [2019-12-07 14:18:14,430 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:18:14,435 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:18:14,443 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:18:14,459 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:18:14,459 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:18:14,460 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:18:14,460 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:18:14,460 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:18:14,460 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:18:14,460 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:18:14,460 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:18:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 14:18:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:18:14,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:14,479 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-12-07 14:18:14,480 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:14,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:14,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-12-07 14:18:14,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:18:14,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005535430] [2019-12-07 14:18:14,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:18:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:14,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:18:14,608 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:18:14,636 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:18:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:18:14,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005535430] [2019-12-07 14:18:14,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:14,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:18:14,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12360794] [2019-12-07 14:18:14,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:18:14,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:18:14,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:18:14,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:14,667 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-12-07 14:18:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:14,789 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-12-07 14:18:14,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:18:14,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 14:18:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:14,806 INFO L225 Difference]: With dead ends: 564 [2019-12-07 14:18:14,806 INFO L226 Difference]: Without dead ends: 385 [2019-12-07 14:18:14,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-07 14:18:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-12-07 14:18:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-12-07 14:18:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-12-07 14:18:14,863 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-12-07 14:18:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:14,864 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-12-07 14:18:14,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:18:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-12-07 14:18:14,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 14:18:14,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:14,867 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:15,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 14:18:15,068 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:15,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:15,070 INFO L82 PathProgramCache]: Analyzing trace with hash -718881007, now seen corresponding path program 1 times [2019-12-07 14:18:15,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:18:15,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967039223] [2019-12-07 14:18:15,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:18:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:15,291 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:18:15,294 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:18:15,307 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:18:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:18:15,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967039223] [2019-12-07 14:18:15,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:15,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:18:15,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214883889] [2019-12-07 14:18:15,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:18:15,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:18:15,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:18:15,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:15,323 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-12-07 14:18:16,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:16,938 INFO L93 Difference]: Finished difference Result 880 states and 1354 transitions. [2019-12-07 14:18:16,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:18:16,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 14:18:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:16,941 INFO L225 Difference]: With dead ends: 880 [2019-12-07 14:18:16,942 INFO L226 Difference]: Without dead ends: 629 [2019-12-07 14:18:16,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:16,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-12-07 14:18:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2019-12-07 14:18:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-12-07 14:18:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 953 transitions. [2019-12-07 14:18:16,968 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 953 transitions. Word has length 58 [2019-12-07 14:18:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:16,969 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 953 transitions. [2019-12-07 14:18:16,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:18:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 953 transitions. [2019-12-07 14:18:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 14:18:16,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:16,974 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:17,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 14:18:17,175 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:17,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:17,176 INFO L82 PathProgramCache]: Analyzing trace with hash 317355092, now seen corresponding path program 1 times [2019-12-07 14:18:17,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:18:17,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847064453] [2019-12-07 14:18:17,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:18:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:17,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:18:17,375 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:18:17,413 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:18:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:18:17,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847064453] [2019-12-07 14:18:17,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:17,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:18:17,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623652710] [2019-12-07 14:18:17,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:18:17,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:18:17,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:18:17,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:17,436 INFO L87 Difference]: Start difference. First operand 627 states and 953 transitions. Second operand 4 states. [2019-12-07 14:18:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:18,033 INFO L93 Difference]: Finished difference Result 1366 states and 2090 transitions. [2019-12-07 14:18:18,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:18:18,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-12-07 14:18:18,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:18,038 INFO L225 Difference]: With dead ends: 1366 [2019-12-07 14:18:18,038 INFO L226 Difference]: Without dead ends: 871 [2019-12-07 14:18:18,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:18,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2019-12-07 14:18:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2019-12-07 14:18:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-12-07 14:18:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1321 transitions. [2019-12-07 14:18:18,063 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1321 transitions. Word has length 119 [2019-12-07 14:18:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:18,064 INFO L462 AbstractCegarLoop]: Abstraction has 871 states and 1321 transitions. [2019-12-07 14:18:18,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:18:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1321 transitions. [2019-12-07 14:18:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 14:18:18,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:18,066 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:18,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 14:18:18,267 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:18,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:18,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2038642215, now seen corresponding path program 1 times [2019-12-07 14:18:18,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:18:18,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200034978] [2019-12-07 14:18:18,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:18:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:18,444 INFO L264 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:18:18,448 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:18:18,470 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:18:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:18:18,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200034978] [2019-12-07 14:18:18,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:18,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:18:18,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457479746] [2019-12-07 14:18:18,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:18:18,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:18:18,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:18:18,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:18,504 INFO L87 Difference]: Start difference. First operand 871 states and 1321 transitions. Second operand 4 states. [2019-12-07 14:18:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:18,987 INFO L93 Difference]: Finished difference Result 1858 states and 2829 transitions. [2019-12-07 14:18:18,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:18:18,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 14:18:18,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:18,994 INFO L225 Difference]: With dead ends: 1858 [2019-12-07 14:18:18,994 INFO L226 Difference]: Without dead ends: 1119 [2019-12-07 14:18:18,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-12-07 14:18:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2019-12-07 14:18:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-12-07 14:18:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1692 transitions. [2019-12-07 14:18:19,035 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1692 transitions. Word has length 148 [2019-12-07 14:18:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:19,035 INFO L462 AbstractCegarLoop]: Abstraction has 1119 states and 1692 transitions. [2019-12-07 14:18:19,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:18:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1692 transitions. [2019-12-07 14:18:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 14:18:19,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:19,039 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:19,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 14:18:19,240 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:19,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:19,240 INFO L82 PathProgramCache]: Analyzing trace with hash 928802567, now seen corresponding path program 1 times [2019-12-07 14:18:19,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:18:19,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965079544] [2019-12-07 14:18:19,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:18:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:19,536 INFO L264 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:18:19,540 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:19,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:18:19,577 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:18:19,581 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:19,581 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:18:19,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:18:19,610 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:18:19,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 14:18:19,611 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:18:19,618 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:19,618 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:18:19,618 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 14:18:19,642 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:18:19,642 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 28 treesize of output 10 [2019-12-07 14:18:19,643 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:18:19,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:19,645 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:18:19,645 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:18:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-07 14:18:19,687 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:18:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-07 14:18:19,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965079544] [2019-12-07 14:18:19,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:19,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 14:18:19,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938049735] [2019-12-07 14:18:19,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:18:19,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:18:19,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:18:19,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:18:19,760 INFO L87 Difference]: Start difference. First operand 1119 states and 1692 transitions. Second operand 7 states. [2019-12-07 14:18:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:30,836 INFO L93 Difference]: Finished difference Result 4228 states and 6416 transitions. [2019-12-07 14:18:30,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:18:30,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2019-12-07 14:18:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:30,850 INFO L225 Difference]: With dead ends: 4228 [2019-12-07 14:18:30,850 INFO L226 Difference]: Without dead ends: 3117 [2019-12-07 14:18:30,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:18:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2019-12-07 14:18:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 1343. [2019-12-07 14:18:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-12-07 14:18:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 2078 transitions. [2019-12-07 14:18:30,896 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 2078 transitions. Word has length 172 [2019-12-07 14:18:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:30,896 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 2078 transitions. [2019-12-07 14:18:30,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:18:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 2078 transitions. [2019-12-07 14:18:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 14:18:30,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:30,899 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:31,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 14:18:31,101 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash 383929993, now seen corresponding path program 1 times [2019-12-07 14:18:31,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:18:31,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012364431] [2019-12-07 14:18:31,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:18:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:31,475 INFO L264 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:18:31,478 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:31,497 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:18:31,497 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:18:31,497 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:18:31,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:31,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:18:31,506 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:18:31,523 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:18:31,523 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 28 treesize of output 10 [2019-12-07 14:18:31,524 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:18:31,525 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:31,525 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:18:31,525 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:18:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:18:31,554 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:18:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:18:31,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012364431] [2019-12-07 14:18:31,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:31,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-12-07 14:18:31,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672670347] [2019-12-07 14:18:31,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:18:31,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:18:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:18:31,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:18:31,584 INFO L87 Difference]: Start difference. First operand 1343 states and 2078 transitions. Second operand 5 states. [2019-12-07 14:18:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:39,280 INFO L93 Difference]: Finished difference Result 3250 states and 5028 transitions. [2019-12-07 14:18:39,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:18:39,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-12-07 14:18:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:39,289 INFO L225 Difference]: With dead ends: 3250 [2019-12-07 14:18:39,289 INFO L226 Difference]: Without dead ends: 1915 [2019-12-07 14:18:39,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:18:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2019-12-07 14:18:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1595. [2019-12-07 14:18:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-07 14:18:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2519 transitions. [2019-12-07 14:18:39,332 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2519 transitions. Word has length 172 [2019-12-07 14:18:39,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:39,332 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 2519 transitions. [2019-12-07 14:18:39,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:18:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2519 transitions. [2019-12-07 14:18:39,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 14:18:39,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:39,335 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:39,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 14:18:39,536 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:39,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:39,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1861094142, now seen corresponding path program 1 times [2019-12-07 14:18:39,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:18:39,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495827327] [2019-12-07 14:18:39,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:18:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:39,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:18:39,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:39,899 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:18:39,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:18:39,900 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:18:39,909 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:39,909 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:18:39,910 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:18:39,928 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:18:39,929 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 28 treesize of output 10 [2019-12-07 14:18:39,929 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:18:39,931 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:39,931 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:18:39,931 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:18:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:18:39,982 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:18:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:18:40,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495827327] [2019-12-07 14:18:40,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:40,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:18:40,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128326629] [2019-12-07 14:18:40,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:18:40,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:18:40,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:18:40,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:18:40,019 INFO L87 Difference]: Start difference. First operand 1595 states and 2519 transitions. Second operand 6 states. [2019-12-07 14:18:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:49,468 INFO L93 Difference]: Finished difference Result 4739 states and 7397 transitions. [2019-12-07 14:18:49,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:18:49,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 185 [2019-12-07 14:18:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:49,482 INFO L225 Difference]: With dead ends: 4739 [2019-12-07 14:18:49,482 INFO L226 Difference]: Without dead ends: 3152 [2019-12-07 14:18:49,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:18:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2019-12-07 14:18:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 1867. [2019-12-07 14:18:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-12-07 14:18:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2952 transitions. [2019-12-07 14:18:49,534 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2952 transitions. Word has length 185 [2019-12-07 14:18:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:49,534 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 2952 transitions. [2019-12-07 14:18:49,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:18:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2952 transitions. [2019-12-07 14:18:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 14:18:49,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:49,538 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:49,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 14:18:49,740 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:49,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:49,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1275904434, now seen corresponding path program 1 times [2019-12-07 14:18:49,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:18:49,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180327123] [2019-12-07 14:18:49,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:18:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:49,983 INFO L264 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:18:49,985 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:18:49,989 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_193|, |v_#memory_$Pointer$.offset_193|], 4=[|v_#memory_int_217|]} [2019-12-07 14:18:49,992 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 109 treesize of output 73 [2019-12-07 14:18:49,992 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:18:49,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:50,001 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 73 treesize of output 49 [2019-12-07 14:18:50,002 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:18:50,008 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:50,038 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:50,038 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 2 case distinctions, treesize of input 49 treesize of output 55 [2019-12-07 14:18:50,039 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:18:58,176 WARN L192 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 14:18:58,176 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:58,177 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:18:58,177 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-12-07 14:18:58,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:18:58,185 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:18:58,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:18:58,187 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:18:58,187 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:18:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-12-07 14:18:58,208 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:18:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-12-07 14:18:58,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180327123] [2019-12-07 14:18:58,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:58,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 14:18:58,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437240353] [2019-12-07 14:18:58,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:18:58,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:18:58,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:18:58,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:18:58,228 INFO L87 Difference]: Start difference. First operand 1867 states and 2952 transitions. Second operand 4 states. [2019-12-07 14:19:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:01,596 INFO L93 Difference]: Finished difference Result 3843 states and 6037 transitions. [2019-12-07 14:19:01,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:19:01,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-12-07 14:19:01,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:01,605 INFO L225 Difference]: With dead ends: 3843 [2019-12-07 14:19:01,605 INFO L226 Difference]: Without dead ends: 1984 [2019-12-07 14:19:01,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:19:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2019-12-07 14:19:01,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1867. [2019-12-07 14:19:01,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-12-07 14:19:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2943 transitions. [2019-12-07 14:19:01,663 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2943 transitions. Word has length 186 [2019-12-07 14:19:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:01,663 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 2943 transitions. [2019-12-07 14:19:01,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:19:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2943 transitions. [2019-12-07 14:19:01,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 14:19:01,666 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:01,666 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:01,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 14:19:01,868 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:01,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash 593014019, now seen corresponding path program 1 times [2019-12-07 14:19:01,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:19:01,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842604435] [2019-12-07 14:19:01,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:19:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:02,243 INFO L264 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:19:02,245 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:19:02,262 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:19:02,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:19:02,262 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:19:02,271 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:19:02,271 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:19:02,271 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:19:02,288 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:19:02,288 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 28 treesize of output 10 [2019-12-07 14:19:02,288 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:19:02,289 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:19:02,290 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:19:02,290 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:19:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:19:02,314 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:19:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 14:19:02,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842604435] [2019-12-07 14:19:02,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:02,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:19:02,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784914318] [2019-12-07 14:19:02,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:19:02,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:19:02,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:19:02,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:19:02,351 INFO L87 Difference]: Start difference. First operand 1867 states and 2943 transitions. Second operand 6 states. [2019-12-07 14:19:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:08,834 INFO L93 Difference]: Finished difference Result 4921 states and 7633 transitions. [2019-12-07 14:19:08,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:19:08,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-12-07 14:19:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:08,845 INFO L225 Difference]: With dead ends: 4921 [2019-12-07 14:19:08,846 INFO L226 Difference]: Without dead ends: 3062 [2019-12-07 14:19:08,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:19:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2019-12-07 14:19:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 1875. [2019-12-07 14:19:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-12-07 14:19:08,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2933 transitions. [2019-12-07 14:19:08,893 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2933 transitions. Word has length 186 [2019-12-07 14:19:08,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:08,893 INFO L462 AbstractCegarLoop]: Abstraction has 1875 states and 2933 transitions. [2019-12-07 14:19:08,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:19:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2933 transitions. [2019-12-07 14:19:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 14:19:08,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:08,896 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:09,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 14:19:09,097 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:09,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:09,098 INFO L82 PathProgramCache]: Analyzing trace with hash -699433533, now seen corresponding path program 1 times [2019-12-07 14:19:09,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:19:09,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866475351] [2019-12-07 14:19:09,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:19:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:09,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:19:09,319 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:19:09,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:19:09,324 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:19:09,327 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:19:09,327 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:19:09,327 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:19:09,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:19:09,334 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:19:09,335 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:19:09,336 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:19:09,336 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:19:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 14:19:09,364 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:19:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 14:19:09,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866475351] [2019-12-07 14:19:09,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:09,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:19:09,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576455783] [2019-12-07 14:19:09,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:19:09,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:19:09,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:19:09,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:19:09,420 INFO L87 Difference]: Start difference. First operand 1875 states and 2933 transitions. Second operand 6 states. [2019-12-07 14:19:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:21,690 INFO L93 Difference]: Finished difference Result 5730 states and 8874 transitions. [2019-12-07 14:19:21,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:19:21,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-12-07 14:19:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:21,704 INFO L225 Difference]: With dead ends: 5730 [2019-12-07 14:19:21,704 INFO L226 Difference]: Without dead ends: 3863 [2019-12-07 14:19:21,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:19:21,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2019-12-07 14:19:21,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 2294. [2019-12-07 14:19:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2294 states. [2019-12-07 14:19:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 3698 transitions. [2019-12-07 14:19:21,759 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 3698 transitions. Word has length 186 [2019-12-07 14:19:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:21,759 INFO L462 AbstractCegarLoop]: Abstraction has 2294 states and 3698 transitions. [2019-12-07 14:19:21,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:19:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 3698 transitions. [2019-12-07 14:19:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-12-07 14:19:21,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:21,763 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:21,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 14:19:21,964 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:21,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1941280911, now seen corresponding path program 1 times [2019-12-07 14:19:21,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:19:21,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769614633] [2019-12-07 14:19:21,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:19:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:22,204 INFO L264 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:19:22,206 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:19:22,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:19:22,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:19:22,214 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:19:22,214 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:19:22,214 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:19:22,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:19:22,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:19:22,223 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:19:22,223 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:19:22,223 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:19:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 14:19:22,252 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:19:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 14:19:22,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769614633] [2019-12-07 14:19:22,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:22,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:19:22,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095310254] [2019-12-07 14:19:22,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:19:22,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:19:22,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:19:22,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:19:22,294 INFO L87 Difference]: Start difference. First operand 2294 states and 3698 transitions. Second operand 6 states. [2019-12-07 14:19:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:35,716 INFO L93 Difference]: Finished difference Result 6253 states and 9870 transitions. [2019-12-07 14:19:35,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:19:35,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-12-07 14:19:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:35,731 INFO L225 Difference]: With dead ends: 6253 [2019-12-07 14:19:35,732 INFO L226 Difference]: Without dead ends: 3931 [2019-12-07 14:19:35,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:19:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2019-12-07 14:19:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 2437. [2019-12-07 14:19:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2437 states. [2019-12-07 14:19:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3976 transitions. [2019-12-07 14:19:35,790 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3976 transitions. Word has length 187 [2019-12-07 14:19:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:35,790 INFO L462 AbstractCegarLoop]: Abstraction has 2437 states and 3976 transitions. [2019-12-07 14:19:35,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:19:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3976 transitions. [2019-12-07 14:19:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-12-07 14:19:35,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:35,792 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:35,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 14:19:35,994 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:35,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:35,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1036085417, now seen corresponding path program 1 times [2019-12-07 14:19:35,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:19:35,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925337934] [2019-12-07 14:19:35,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:19:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:36,230 INFO L264 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:19:36,233 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:19:36,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:19:36,237 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:19:36,240 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:19:36,240 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:19:36,241 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:19:36,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:19:36,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:19:36,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:19:36,250 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:19:36,250 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:19:36,282 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-12-07 14:19:36,282 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:19:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-12-07 14:19:36,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925337934] [2019-12-07 14:19:36,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:36,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:19:36,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274709820] [2019-12-07 14:19:36,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:19:36,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:19:36,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:19:36,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:19:36,326 INFO L87 Difference]: Start difference. First operand 2437 states and 3976 transitions. Second operand 6 states. [2019-12-07 14:19:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:44,392 INFO L93 Difference]: Finished difference Result 6684 states and 10689 transitions. [2019-12-07 14:19:44,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:19:44,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2019-12-07 14:19:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:44,399 INFO L225 Difference]: With dead ends: 6684 [2019-12-07 14:19:44,399 INFO L226 Difference]: Without dead ends: 4255 [2019-12-07 14:19:44,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:19:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2019-12-07 14:19:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 2725. [2019-12-07 14:19:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2725 states. [2019-12-07 14:19:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2725 states and 4463 transitions. [2019-12-07 14:19:44,465 INFO L78 Accepts]: Start accepts. Automaton has 2725 states and 4463 transitions. Word has length 215 [2019-12-07 14:19:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:44,465 INFO L462 AbstractCegarLoop]: Abstraction has 2725 states and 4463 transitions. [2019-12-07 14:19:44,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:19:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 4463 transitions. [2019-12-07 14:19:44,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-12-07 14:19:44,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:44,468 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:44,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 14:19:44,669 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:44,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:44,670 INFO L82 PathProgramCache]: Analyzing trace with hash -854510337, now seen corresponding path program 1 times [2019-12-07 14:19:44,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:19:44,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006052338] [2019-12-07 14:19:44,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:19:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:44,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:19:44,911 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:19:44,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:19:44,915 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:19:44,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:19:44,918 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:19:44,918 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:19:44,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:19:44,925 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:19:44,927 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:19:44,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:19:44,927 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:19:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-12-07 14:19:44,963 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:19:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-12-07 14:19:45,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006052338] [2019-12-07 14:19:45,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:45,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:19:45,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161018473] [2019-12-07 14:19:45,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:19:45,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:19:45,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:19:45,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:19:45,019 INFO L87 Difference]: Start difference. First operand 2725 states and 4463 transitions. Second operand 6 states. [2019-12-07 14:19:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:56,626 INFO L93 Difference]: Finished difference Result 7287 states and 11681 transitions. [2019-12-07 14:19:56,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:19:56,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 227 [2019-12-07 14:19:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:56,632 INFO L225 Difference]: With dead ends: 7287 [2019-12-07 14:19:56,632 INFO L226 Difference]: Without dead ends: 4570 [2019-12-07 14:19:56,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:19:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2019-12-07 14:19:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 3102. [2019-12-07 14:19:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2019-12-07 14:19:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 5111 transitions. [2019-12-07 14:19:56,707 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 5111 transitions. Word has length 227 [2019-12-07 14:19:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:56,708 INFO L462 AbstractCegarLoop]: Abstraction has 3102 states and 5111 transitions. [2019-12-07 14:19:56,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:19:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 5111 transitions. [2019-12-07 14:19:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-12-07 14:19:56,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:56,711 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:56,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 14:19:56,912 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:56,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:56,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1627000109, now seen corresponding path program 1 times [2019-12-07 14:19:56,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:19:56,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886191614] [2019-12-07 14:19:56,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:19:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:57,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:19:57,279 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:19:57,295 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:19:57,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:19:57,296 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:19:57,303 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:19:57,303 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:19:57,304 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:19:57,319 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:19:57,320 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 28 treesize of output 10 [2019-12-07 14:19:57,320 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:19:57,321 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:19:57,321 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:19:57,321 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:19:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-12-07 14:19:57,350 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:19:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-12-07 14:19:57,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886191614] [2019-12-07 14:19:57,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:57,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:19:57,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943716620] [2019-12-07 14:19:57,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:19:57,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:19:57,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:19:57,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:19:57,411 INFO L87 Difference]: Start difference. First operand 3102 states and 5111 transitions. Second operand 6 states. [2019-12-07 14:20:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:04,649 INFO L93 Difference]: Finished difference Result 7124 states and 11467 transitions. [2019-12-07 14:20:04,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:20:04,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2019-12-07 14:20:04,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:04,658 INFO L225 Difference]: With dead ends: 7124 [2019-12-07 14:20:04,658 INFO L226 Difference]: Without dead ends: 4030 [2019-12-07 14:20:04,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:20:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4030 states. [2019-12-07 14:20:04,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4030 to 3102. [2019-12-07 14:20:04,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2019-12-07 14:20:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 5050 transitions. [2019-12-07 14:20:04,735 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 5050 transitions. Word has length 228 [2019-12-07 14:20:04,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:04,735 INFO L462 AbstractCegarLoop]: Abstraction has 3102 states and 5050 transitions. [2019-12-07 14:20:04,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:20:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 5050 transitions. [2019-12-07 14:20:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-12-07 14:20:04,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:04,739 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:04,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 14:20:04,940 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:20:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1851196499, now seen corresponding path program 1 times [2019-12-07 14:20:04,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:20:04,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434745232] [2019-12-07 14:20:04,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:20:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:05,167 INFO L264 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:20:05,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:05,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:20:05,174 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:05,176 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:05,176 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:05,176 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:20:05,184 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:20:05,184 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:05,185 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:05,185 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:05,186 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:20:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-12-07 14:20:05,223 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-12-07 14:20:05,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434745232] [2019-12-07 14:20:05,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:05,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:20:05,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969370446] [2019-12-07 14:20:05,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:20:05,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:20:05,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:20:05,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:05,286 INFO L87 Difference]: Start difference. First operand 3102 states and 5050 transitions. Second operand 6 states. [2019-12-07 14:20:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:16,633 INFO L93 Difference]: Finished difference Result 7628 states and 12136 transitions. [2019-12-07 14:20:16,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:20:16,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2019-12-07 14:20:16,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:16,638 INFO L225 Difference]: With dead ends: 7628 [2019-12-07 14:20:16,639 INFO L226 Difference]: Without dead ends: 4498 [2019-12-07 14:20:16,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:20:16,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4498 states. [2019-12-07 14:20:16,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4498 to 3084. [2019-12-07 14:20:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3084 states. [2019-12-07 14:20:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 5006 transitions. [2019-12-07 14:20:16,715 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 5006 transitions. Word has length 228 [2019-12-07 14:20:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:16,715 INFO L462 AbstractCegarLoop]: Abstraction has 3084 states and 5006 transitions. [2019-12-07 14:20:16,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:20:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 5006 transitions. [2019-12-07 14:20:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-12-07 14:20:16,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:16,718 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:16,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 14:20:16,919 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:20:16,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:16,920 INFO L82 PathProgramCache]: Analyzing trace with hash 99711935, now seen corresponding path program 1 times [2019-12-07 14:20:16,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:20:16,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332502474] [2019-12-07 14:20:16,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:20:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:17,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:20:17,433 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:17,452 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:20:17,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:20:17,452 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:17,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:17,460 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:17,460 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:20:17,487 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:20:17,487 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 28 treesize of output 10 [2019-12-07 14:20:17,488 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:17,489 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:17,489 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:17,489 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:20:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-12-07 14:20:17,520 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-12-07 14:20:17,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332502474] [2019-12-07 14:20:17,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:17,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:20:17,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843974868] [2019-12-07 14:20:17,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:20:17,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:20:17,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:20:17,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:17,562 INFO L87 Difference]: Start difference. First operand 3084 states and 5006 transitions. Second operand 6 states. [2019-12-07 14:20:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:27,393 INFO L93 Difference]: Finished difference Result 7088 states and 11257 transitions. [2019-12-07 14:20:27,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:20:27,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2019-12-07 14:20:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:27,398 INFO L225 Difference]: With dead ends: 7088 [2019-12-07 14:20:27,398 INFO L226 Difference]: Without dead ends: 4012 [2019-12-07 14:20:27,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:20:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2019-12-07 14:20:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 3084. [2019-12-07 14:20:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3084 states. [2019-12-07 14:20:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 4945 transitions. [2019-12-07 14:20:27,482 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 4945 transitions. Word has length 228 [2019-12-07 14:20:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:27,482 INFO L462 AbstractCegarLoop]: Abstraction has 3084 states and 4945 transitions. [2019-12-07 14:20:27,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:20:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 4945 transitions. [2019-12-07 14:20:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-12-07 14:20:27,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:27,486 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:27,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 14:20:27,687 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:20:27,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:27,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1776032218, now seen corresponding path program 1 times [2019-12-07 14:20:27,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:20:27,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274589166] [2019-12-07 14:20:27,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:20:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:28,107 INFO L264 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:20:28,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:28,126 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:20:28,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:20:28,126 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:28,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:28,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:28,134 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:20:28,147 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:20:28,147 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 28 treesize of output 10 [2019-12-07 14:20:28,148 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:28,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:28,149 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:28,149 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:20:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-12-07 14:20:28,180 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-12-07 14:20:28,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274589166] [2019-12-07 14:20:28,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:28,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:20:28,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671560142] [2019-12-07 14:20:28,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:20:28,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:20:28,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:20:28,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:28,221 INFO L87 Difference]: Start difference. First operand 3084 states and 4945 transitions. Second operand 6 states. [2019-12-07 14:20:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:34,478 INFO L93 Difference]: Finished difference Result 7088 states and 11135 transitions. [2019-12-07 14:20:34,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:20:34,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 229 [2019-12-07 14:20:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:34,482 INFO L225 Difference]: With dead ends: 7088 [2019-12-07 14:20:34,482 INFO L226 Difference]: Without dead ends: 4012 [2019-12-07 14:20:34,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:20:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2019-12-07 14:20:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 3084. [2019-12-07 14:20:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3084 states. [2019-12-07 14:20:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 4884 transitions. [2019-12-07 14:20:34,561 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 4884 transitions. Word has length 229 [2019-12-07 14:20:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:34,562 INFO L462 AbstractCegarLoop]: Abstraction has 3084 states and 4884 transitions. [2019-12-07 14:20:34,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:20:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 4884 transitions. [2019-12-07 14:20:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-12-07 14:20:34,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:34,565 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:34,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 14:20:34,766 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:20:34,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:34,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1128207674, now seen corresponding path program 1 times [2019-12-07 14:20:34,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:20:34,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115482557] [2019-12-07 14:20:34,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:20:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:35,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:20:35,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:35,198 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:20:35,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:20:35,198 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:35,205 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:35,206 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:35,206 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:20:35,220 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:20:35,220 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 28 treesize of output 10 [2019-12-07 14:20:35,220 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:35,221 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:35,221 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:35,222 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:20:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-12-07 14:20:35,254 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-12-07 14:20:35,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115482557] [2019-12-07 14:20:35,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:35,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:20:35,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992463078] [2019-12-07 14:20:35,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:20:35,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:20:35,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:20:35,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:35,295 INFO L87 Difference]: Start difference. First operand 3084 states and 4884 transitions. Second operand 6 states. [2019-12-07 14:20:44,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:44,224 INFO L93 Difference]: Finished difference Result 7088 states and 11013 transitions. [2019-12-07 14:20:44,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:20:44,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2019-12-07 14:20:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:44,228 INFO L225 Difference]: With dead ends: 7088 [2019-12-07 14:20:44,228 INFO L226 Difference]: Without dead ends: 4012 [2019-12-07 14:20:44,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:20:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2019-12-07 14:20:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 3084. [2019-12-07 14:20:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3084 states. [2019-12-07 14:20:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 4823 transitions. [2019-12-07 14:20:44,308 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 4823 transitions. Word has length 230 [2019-12-07 14:20:44,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:44,309 INFO L462 AbstractCegarLoop]: Abstraction has 3084 states and 4823 transitions. [2019-12-07 14:20:44,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:20:44,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 4823 transitions. [2019-12-07 14:20:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-12-07 14:20:44,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:44,312 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:44,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 14:20:44,513 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:20:44,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1446337525, now seen corresponding path program 1 times [2019-12-07 14:20:44,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:20:44,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367914636] [2019-12-07 14:20:44,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:20:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:44,911 INFO L264 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:20:44,913 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:44,930 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:20:44,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:20:44,931 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:44,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:44,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:44,938 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:20:44,953 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:20:44,953 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 28 treesize of output 10 [2019-12-07 14:20:44,953 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:44,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:44,955 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:44,955 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:20:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-12-07 14:20:44,988 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-12-07 14:20:45,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367914636] [2019-12-07 14:20:45,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:45,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:20:45,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220207417] [2019-12-07 14:20:45,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:20:45,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:20:45,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:20:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:45,041 INFO L87 Difference]: Start difference. First operand 3084 states and 4823 transitions. Second operand 6 states. [2019-12-07 14:20:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:55,423 INFO L93 Difference]: Finished difference Result 6908 states and 10657 transitions. [2019-12-07 14:20:55,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:20:55,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 231 [2019-12-07 14:20:55,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:55,428 INFO L225 Difference]: With dead ends: 6908 [2019-12-07 14:20:55,428 INFO L226 Difference]: Without dead ends: 3832 [2019-12-07 14:20:55,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:20:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3832 states. [2019-12-07 14:20:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3832 to 3084. [2019-12-07 14:20:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3084 states. [2019-12-07 14:20:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 4762 transitions. [2019-12-07 14:20:55,512 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 4762 transitions. Word has length 231 [2019-12-07 14:20:55,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:55,512 INFO L462 AbstractCegarLoop]: Abstraction has 3084 states and 4762 transitions. [2019-12-07 14:20:55,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:20:55,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 4762 transitions. [2019-12-07 14:20:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-12-07 14:20:55,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:55,515 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:55,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 14:20:55,717 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:20:55,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:55,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1167711913, now seen corresponding path program 1 times [2019-12-07 14:20:55,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:20:55,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229339198] [2019-12-07 14:20:55,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/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-12-07 14:20:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:56,247 INFO L264 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 14:20:56,254 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:56,338 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-12-07 14:20:56,338 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,584 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 14:20:56,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,586 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_304|], 2=[|v_#memory_$Pointer$.base_298|, |v_#memory_$Pointer$.base_297|]} [2019-12-07 14:20:56,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,641 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 14:20:56,642 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:20:56,760 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:20:56,800 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,815 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,815 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 14:20:56,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:20:56,828 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,834 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,834 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:20:56,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,839 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:20:56,839 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,845 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,846 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,846 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:20:56,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:20:56,855 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:20:56,871 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,876 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,876 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,876 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 14:20:56,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:20:56,881 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,885 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,885 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,886 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:20:56,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:20:56,889 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,894 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,894 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,894 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:20:56,900 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:20:56,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:56,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 23 [2019-12-07 14:20:56,922 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,930 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,930 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:56,930 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 14:20:56,933 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_299|], 2=[|v_#memory_$Pointer$.base_311|]} [2019-12-07 14:20:56,935 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 49 treesize of output 37 [2019-12-07 14:20:56,935 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:20:56,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,982 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:56,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 14:20:56,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:20:56,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:20:56,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:20:56,985 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 14:20:57,002 INFO L614 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-12-07 14:20:57,002 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:57,002 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 14:20:57,005 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:20:57,026 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:57,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:57,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:57,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:57,030 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 23 [2019-12-07 14:20:57,030 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:57,039 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:57,039 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:57,039 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 14:20:57,042 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_300|], 2=[|v_#memory_$Pointer$.base_313|]} [2019-12-07 14:20:57,045 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 49 treesize of output 37 [2019-12-07 14:20:57,045 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:20:57,057 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:57,089 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:57,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 14:20:57,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:20:57,090 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:57,105 INFO L614 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-12-07 14:20:57,105 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:57,105 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 14:20:57,108 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_332|, |v_#memory_$Pointer$.offset_301|], 2=[|v_#memory_$Pointer$.base_314|, |v_#memory_$Pointer$.base_302|, |v_#memory_$Pointer$.offset_297|], 6=[|v_#memory_$Pointer$.base_303|, |v_#memory_$Pointer$.offset_298|]} [2019-12-07 14:20:57,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:57,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:57,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 14:20:57,374 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:58,019 WARN L192 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-07 14:20:58,020 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:58,069 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 19 treesize of output 1 [2019-12-07 14:20:58,069 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:58,515 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 14:20:58,515 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:58,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:58,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:20:58,580 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:58,760 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 14:20:58,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:58,765 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:20:58,935 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 14:20:58,935 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:58,941 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:20:59,099 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 14:20:59,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:59,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:21:21,516 WARN L192 SmtUtils]: Spent 22.41 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-12-07 14:21:21,517 INFO L343 Elim1Store]: treesize reduction 40, result has 69.0 percent of original size [2019-12-07 14:21:21,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 162 [2019-12-07 14:21:21,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:21,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:21,518 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:21,657 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 14:21:21,658 INFO L614 ElimStorePlain]: treesize reduction 34, result has 81.4 percent of original size [2019-12-07 14:21:21,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:21:21,664 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 58 [2019-12-07 14:21:21,664 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:21,690 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:21,690 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:21,690 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:297, output treesize:55 [2019-12-07 14:21:21,719 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_302|, |v_#memory_$Pointer$.base_315|], 12=[|v_#memory_int_333|]} [2019-12-07 14:21:21,722 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 55 treesize of output 43 [2019-12-07 14:21:21,722 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:21:21,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:21,751 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 53 treesize of output 35 [2019-12-07 14:21:21,751 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:21:21,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:21,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:21:21,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2019-12-07 14:21:21,782 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:21,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:21,797 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:21:21,797 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:86, output treesize:35 [2019-12-07 14:21:21,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 13 [2019-12-07 14:21:21,842 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:21,847 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:21,848 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:21,848 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-12-07 14:21:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 235 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:21:22,042 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:21:22,084 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.offset_308|, |v_#memory_$Pointer$.base_302|, |v_#memory_$Pointer$.offset_297|, |v_#memory_$Pointer$.base_321|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.base_303|, |v_#memory_$Pointer$.offset_298|]} [2019-12-07 14:21:22,126 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 20 treesize of output 1 [2019-12-07 14:21:22,126 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:22,435 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 14:21:22,436 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:22,445 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:21:22,658 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 14:21:22,658 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:22,668 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:21:22,822 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 14:21:22,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:22,830 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:21:22,941 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 14:21:22,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:22,944 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:21:22,996 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:23,002 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 13842 treesize of output 12498 [2019-12-07 14:21:23,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:23,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:23,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:23,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:21:24,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:24,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:24,123 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2019-12-07 14:21:25,162 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 155 DAG size of output: 50 [2019-12-07 14:21:25,162 INFO L614 ElimStorePlain]: treesize reduction 711643, result has 0.0 percent of original size [2019-12-07 14:21:25,164 INFO L534 ElimStorePlain]: Start of recursive call 8: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-12-07 14:21:25,213 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:33,420 WARN L192 SmtUtils]: Spent 8.19 s on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 14:21:33,420 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:33,420 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 175 [2019-12-07 14:21:33,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:21:33,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:33,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:33,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:33,478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 26 [2019-12-07 14:21:33,501 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:21:33,511 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:21:33,528 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 21 treesize of output 13 [2019-12-07 14:21:33,528 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:33,531 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:33,531 INFO L534 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:33,901 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 77 [2019-12-07 14:21:33,901 INFO L614 ElimStorePlain]: treesize reduction 285, result has 53.3 percent of original size [2019-12-07 14:21:33,938 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:33,939 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 120 treesize of output 120 [2019-12-07 14:21:33,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:33,947 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:21:33,948 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_63], 1=[v_arrayElimCell_64]} [2019-12-07 14:21:33,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229339198] [2019-12-07 14:21:33,957 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@543921eb [2019-12-07 14:21:33,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1036668361] [2019-12-07 14:21:33,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:21:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:37,872 INFO L264 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 14:21:37,872 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@543921eb [2019-12-07 14:21:37,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950659390] [2019-12-07 14:21:37,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b7ba1bb-cf6f-4000-88c0-9abd0fa82fcf/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:21:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:38,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:21:38,026 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:38,028 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@543921eb [2019-12-07 14:21:38,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:21:38,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 14:21:38,028 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 14:21:38,028 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:21:38,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:21:38,689 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 14:21:38,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:21:38 BoogieIcfgContainer [2019-12-07 14:21:38,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:21:38,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:21:38,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:21:38,690 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:21:38,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:18:14" (3/4) ... [2019-12-07 14:21:38,692 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:21:38,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:21:38,693 INFO L168 Benchmark]: Toolchain (without parser) took 207700.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 945.7 MB in the beginning and 926.4 MB in the end (delta: 19.3 MB). Peak memory consumption was 243.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:21:38,693 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:21:38,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:21:38,693 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:21:38,694 INFO L168 Benchmark]: Boogie Preprocessor took 51.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:21:38,694 INFO L168 Benchmark]: RCFGBuilder took 2919.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.3 MB in the end (delta: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:21:38,694 INFO L168 Benchmark]: TraceAbstraction took 204269.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.0 MB). Free memory was 987.3 MB in the beginning and 926.4 MB in the end (delta: 60.9 MB). Peak memory consumption was 158.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:21:38,694 INFO L168 Benchmark]: Witness Printer took 2.59 ms. Allocated memory is still 1.3 GB. Free memory is still 926.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:21:38,695 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 400.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2919.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.3 MB in the end (delta: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 204269.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.0 MB). Free memory was 987.3 MB in the beginning and 926.4 MB in the end (delta: 60.9 MB). Peak memory consumption was 158.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.59 ms. Allocated memory is still 1.3 GB. Free memory is still 926.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) [L1130] EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 [L1347] COND FALSE !(ret <= 0) [L1352] s->hit [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 [L1357] s->init_num = 0 [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 6 [L1370] COND FALSE !(ret <= 0) [L1376] s->state = 8528 [L1377] s->init_num = 0 [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 6 [L1407] blastFlag = 7 [L1411] COND FALSE !(ret <= 0) [L1428] s->state = 8544 [L1429] s->init_num = 0 [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND FALSE !(blastFlag == 8) [L1461] COND FALSE !(ret <= 0) [L1466] s->state = 8448 [L1467] EXPR s->s3 [L1467] (s->s3)->tmp.next_state = 8576 [L1468] s->init_num = 0 [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state [L1235] COND TRUE s->state == 8672 [L1599] ret = __VERIFIER_nondet_int() [L1600] COND FALSE !(blastFlag == 3) [L1603] COND FALSE !(blastFlag == 4) [L1606] COND TRUE blastFlag == 7 [L1607] blastFlag = 8 [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8448 [L1619] s->hit [L1619] COND TRUE s->hit [L1620] EXPR s->s3 [L1620] (s->s3)->tmp.next_state = 8640 [L1624] s->init_num = 0 [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 8 [L1726] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNKNOWN, OverallTime: 204.1s, OverallIterations: 20, TraceHistogramMax: 9, AutomataDifference: 140.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4054 SDtfs, 4433 SDslu, 8297 SDs, 0 SdLazy, 7980 SolverSat, 1003 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 132.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6890 GetRequests, 6795 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3102occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 16622 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 3450 NumberOfCodeBlocks, 3450 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 6862 ConstructedInterpolants, 0 QuantifiedInterpolants, 2644817 SizeOfPredicates, 71 NumberOfNonLiveVariables, 8066 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 12320/12320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...